Full text
PDF
. 1965 Feb;53(2):244–247. doi: 10.1073/pnas.53.2.244
ON THE APPLICATION OF DYNAMIC PROGRAMING TO THE DETERMINATION OF OPTIMAL PLAY IN CHESS AND CHECKERS*
1THE RAND CORPORATION, SANTA MONICA, CALIFORNIA
*
The results presented above are part of research carried on in the area of pattern recognition in collaboration with John M. Richardson at the Hughes Research Laboratories at Malibu, California, as a consultant. Preliminary results were given in Bellman, R., System Identification, Pattern Recognition and Dynamic Programming—I: General Concepts, Hughes Research Laboratories (1964); System Identification, Pattern Recognition and Dynamic Programming—II: Endgames in Chess, Hughes Research Laboratories (1964); System Identification, Pattern Recognition and Dynamic Programming—III: The Game of Checkers, Hughes Research Laboratories (1964); System Identification, Pattern Recognition and Dynamic Programming—IV: Abstraction of Properties and Adaptive Pattern Recognition, Hughes Research Laboratories (1964).
PMCID: PMC219499 PMID: 16591252