Some Studies in Machine Learning Using the Game of Checkers. II—Recent Progress

Abstract

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 otherwise could do. While still unable to outplay checker masters, the program’s playing ability has been greatly improved.