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

Information and Control, 10 (2): , 189–208.

In Hart, J. and Takasu, S. (Eds.), Systems and Computer Science. University of Toronto Press

Harvard University Press

In Proc. Fall Joint Computer Conference, pp. 801–810.

PhD. dissertation, Harvard University, August 1967. Reprinted as a volume in the series Outstanding Dissertations in the Computer Sciences, New York: Garland Publishing, 1979

Wiley.

AFIPS Conference Proceedings 29, Fall Joint Computer Conference. Washington, D.C.: Spartan Books, 357-363.

In Fox, L. (Ed.), Advances in Programming and Non-Numerical Computation, pp. 183–200. Pergamon.

Annals of Mathematical Statistics, 41.