This chapter presents the history and basic ideas of computer chess. In 1864, the subject of computer chess was discussed by Charles Babbage. However, the chess program was introduced in 1955. Alan Newell, John Shaw, and Herbert Simon began work on their program in 1955, at Carnegie-Mellon University in Pittsburgh. The Newell, Shaw, and Simon (NSS) program is different than its predecessors in
... [Show full abstract] three respects. It is the first program written in a high-level language. The chess program is coded in IPL-IV, a language designed to operate on lists and on the types of data structures that arise in chess programs. Their program uses a set of explicit goals to guide the tree search and there are no limits to the width and depth of search. The goals depend on the particular board position. The scoring function is composed of vector components, with each component being a measure of the degree of success in reaching one of the goals. In each position, an analysis is carried out to see if the value of any component of the scoring function might be significantly changed by making a move. Their program uses the alpha–beta algorithm. The alpha–beta algorithm supplements the minimax algorithm: it allows the computer to avoid generating irrelevant sequences of moves in a minimax search. The alpha–beta algorithm is an example of backward pruning. It finds branches from the back of the tree that are unnecessary to examine and prunes them from the tree.