Alpha-beta pruning can be explained simply as a technique for not exploring those branches of a search tree that analysis indicates not to be of further interest either to the player making the analysis (this is obvious) or to his opponent (and this is frequently overlooked).
– Arthur L. Samuel, from Some Studies in Machine Learning Using the Game of Checkers. —Recent Progress. IBM Journal, November 1967, pp. 601-617.
A new signature table technique is described together with an improved book learning procedure which is thought to be much superior to the linear polynomial method described earlier. Full use is made of the so called âalpha-betaâ pruning and several forms of forward pruning to restrict the spread of the move tree and to permit the program to look ahead to a much greater depth than it other- wise could do. While still unable to outplay checker masters, the programâs playing ability has been greatly improved.See also:IEEE XploreAnnual Review in Automatic Programming, Volume 6, Part 1, 1969, Pages 1–36Some Studies in Machine Learning Using the Game of CheckersIBM J of Research and Development ll, No.6, 1967,601