A FIVE-YEAR PLAN FOR AUTOMATIC CHESS

Young animals play games in order to prepare themselves for the business of serious living, without getting hurt in the training period. Game-playing on computers serves a similar function. It can teach us something about the structure of thought processes and the theory of struggle and has the advantage over economic modelling that the rules and objectives are clear-cut. If the machine wins tournaments it must be a good player. The complexity and originality of a master chess player is perhaps greater than that of a professional economist. The chess player continually pits his wits against other players and the precision of the rules makes feasible a depth of thinking comparable to that in mathematics. No program has yet been written that plays chess of even good amateur standard. A really good chess program would be a breakthrough in work on machine intelligence, and would be a great encouragement to workers in other parts of this field and to those who sponsor such work. In criticism of the writing of a chess program, Macdonald (1950) quoted a remark to the effect that a machine for smoking tobacco could be built, but would serve no useful purpose. The irony is that smoking machines have since been built in order to help research on the medical effects of smoking. This does not prove that a chess program should be written, but suggests that the arguments against it might be shallow. Many branches of science, and of pure and applied mathematics, have started with a study of apparently frivolous things such as puzzles and games.

[1]  A. Bernstein,et al.  A chess playing program for the IBM 704 , 1899, IRE-ACM-AIEE '58 (Western).

[2]  W. W. Ball,et al.  Mathematical Recreations and Essays , 1905, Nature.

[3]  Claude E. Shannon,et al.  Programming a computer for playing chess , 1950 .

[4]  L. Stein,et al.  Probability and the Weighing of Evidence , 1950 .

[5]  Eliot Slater,et al.  Statistics for the chess computer and the factor of mobility , 1953, Trans. IRE Prof. Group Inf. Theory.

[6]  M. Wells,et al.  Experiments in Chess , 1957, JACM.

[7]  Allen Newell,et al.  Chess-Playing Programs and the Problem of Complexity , 1958, IBM J. Res. Dev..

[8]  Arthur L. Samuel,et al.  Some Studies in Machine Learning Using the Game of Checkers , 1967, IBM J. Res. Dev..

[9]  A NEWELL,et al.  Computer simulation of human thinking. , 1961, Science.

[10]  I. Good How Rational Should a Manager be , 1962 .

[11]  W. McCulloch,et al.  Embodiments of Mind , 1966 .

[12]  I. J. Good,et al.  Speculations Concerning the First Ultraintelligent Machine , 1965, Adv. Comput..

[13]  H A Simon,et al.  An example of human chess play in the light of chess playing programs. , 1965, Progress in biocybernetics.

[14]  R. M. Burstall,et al.  Advances in programming and non-numerical computation , 1967, The Mathematical Gazette.

[15]  D. Michie GAME-PLAYING AND GAME-LEARNING AUTOMATA , 1966 .

[16]  D. Robitaille Mathematics and Chess. , 1974 .

[17]  A. D. D. Groot Thought and Choice in Chess , 1978 .

[18]  I. Good The Mystery of Go , 1988 .

[19]  J. Banavar,et al.  Computer Simulation of Liquids , 1988 .

[20]  Nick de Firmian Modern Chess Openings , 1999 .

[21]  Mathematics and Chess , 2011 .

[22]  S. Barry Cooper,et al.  Digital Computers Applied to Games , 2013 .

[23]  David Banks,et al.  Games and Decisions , 2015 .