In 1968, a team of Northwestern University graduate students, Larry Atkin, Keith Gorlen, and David Slate, began work on a series of chess programs called at first Chess 2.0, then Chess 3.0, Chess 3.5, Chess 3.6, Chess 4.0 and on and on. They were supported in their work by Ben Mittman, director of the university’s Vogelback Computer Center. Slate and Atkin were good chess players; Slate was an expert while Atkin was a notch weaker. Their succession of programs could be characterized as well debugged with sound heuristics. Chess 3.0 won the first ACM United States Computer Chess Championship in 1970 and continued to dominate the ACM tournaments until Belle came along in the late 1970s.
KeywordsGood Continuation Chess Program Computer Chess Regular Tournament Total Search Time
Unable to display preview. Download preview PDF.
- D. A. Cahlander, “The Computer is a Fish, or is it?” SIGART Newsletter of the ACM (April 1977): 8–11.Google Scholar
- D. Levy, “Invasion from Cyberland,” Chess Life and Review (June 1977): 312–14.Google Scholar
- K. Thompson, “United States Amateur Team Championship,” ICC A Newsletter 3, no. 1 (July 1980): 7–12.Google Scholar
- D. J. Slate and L. R. Atkin, “Chess 4.5—The Northwestern University Chess Program,” in Chess Skill in Man and Machine ed. P. Frey (New York: Springer-Verlag, 1977), 82–118.Google Scholar
- R. E. Korf, “Iteratively-Deepening-A*: An optimal admissible tree search,” Proceedings of the Ninth International Joint Conference on Artificial Intelligence, Los Angeles, California (1985): 1034–36.Google Scholar
- M. E. Stickel and W. M. Tyson, “An analysis of consecutively bounded depth-first search with applications in automated deduction,” Proc. of the Ninth International Joint Conference on Artificial Intelligence, Los Angeles, California (1985): 1073–75.Google Scholar