A Mathematical Representation of Chess

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


The algorithm that we are to work with rests on two principles. The first is that both sides in the end have to strive for material gain (this is not in the rules of the game, but is true in practice). It follows that everything begins with the attack, and the attack defines the trajectory (the path) of the attacking piece. A chess game may be thought of as a debate between the two sides; the attack is an assertion, the defense a negation. The assertion can bring forth a negation, which defines the path of defense (the negation).


Mathematical Representation Material Gain Chess Player Path Function Position Play 
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