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

in Advances in Computers [F. Alt, ed.], New York: Academic

From: Technology Review, November, 62:42-45. See also: Some studies in machine learning using the game of checkers, IBM Journal of Research and Development, 3(3) :210-229, 1959.

The studies reported here have been concerned with the programming of a digital computer to behave in a way which, if done by human beings oranimals, would be described as involving the process of learning. Whilethis is not the place to dwell on the importance of machine-learning procedures,or to discourse on the philosophical aspects,1 there is obviously avery large amount of work, now done by people, which is quite trivial inits demands on the intellect but does, nevertheless, involve some learning.Also in Computers and Thought. Feigenbaum, Edward A. and Julian Feldman (Editors) 1963.See also:IEEE XploreSome Studies in Machine Learning Using the Game of Checkers, II - Recent ProgressIBM Journal of Research and Development, 3:211-229