The Algorithm as a Chess Player

  • M. M. Botvinnik
Part of the Heidelberg Science Library book series (HSL)


Is there any need for a machine to play chess well? Opinions differ. Grandmasters, for example, become irritated at the question and say that this is idle talk—even if there is a need, the answer is far in the future, perhaps 50 years. Some scholars say that there is little use in wasting effort on “teaching” a machine genuine mastery of chess—to make it a second-rank player is enough. The importance and necessity of giving the machine a “higher education” will be proved later; for the present, the reader should accept them as proven.


Generalize Exchange Collective Decision Machine Language Finished Program Chess Player 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag New York Inc 1970

Authors and Affiliations

  • M. M. Botvinnik

There are no affiliations available

Personalised recommendations