An outline of the basic methods for using the theory of dynamic programming, as well as currently available computers, to determine optimal play in the great majority of Pawn-King end-games in chess and, in all probability, in the entire game of checkers. Insofar as the methodology employs the concept of semigroups in structure, it is itself of interest. 5 pp.
This report is part of the RAND Corporation Paper series. The paper was a product of the RAND Corporation from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.
The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.