Inductive acquisition of chess strategies
Machine intelligence 11
How computers play chess
Data compression using an intelligent generator: the storage of chess games as an example
Artificial Intelligence
Chess Skill in Man and Machine
Chess Skill in Man and Machine
Human Problem Solving
Some studies in machine learning using the game of checkers
IBM Journal of Research and Development
User identity verification via mouse dynamics
Information Sciences: an International Journal
| Hi-index | 0.01 |
We investigate the problem of inferring, from records of chess games, some aspects of the strategy used to play the games. Initially, game records are generated from self-play by two simple chess programs, one of which does a one-ply search while the other does a four-ply quiescent search. In each case, we are able to infer, from just the game records, good estimates of the weights used in the evaluation function. The approach is then applied to grandmaster games. Our one-ply and quiescent four-ply programs are now drastic simplifications of the true strategy used. Nonetheless, using inferred weights for these hypothetical models, we are still able to achieve some success (as measured by compression rates for the games) in predicting moves made by the players.