Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Althöfer, I. (1991). Data compression using an intelligent generator: the storage of chess games as an example, Artificial Intelligence, 52, 109–113.
Carmel, D. and Markovitch, S. (1993). Learning models of opponent’s strategy in game playing, (CIS Report #9318), Israel Institute of Technology.
de Groot, A.D. (1978). Thought and Choice in Chess, (2nd ed.), The Hague: Mouton.
Frey, P.W. (1977). Chess Skill in Man and Machine, New York: Springer-Verlag.
Levy, D. and Newborn, M. (1991). How Computers Play Chess, New York: W.H Freeman & Company.
Morales, E.M. (1996). Learning playing strategies in chess, Computational Intelligence, 12(1), 65–87.
Muggleton, S.H. (1988). Inductive acquisition of chess strategies. In J.E. Hayes, D. Michie & J. Richards (Eds.), Machine Intelligence 11: Logic and the Acquisition of Knowledge (pp. 375–389). Oxford.
Newell, A. and Simon, H. A. (1972). Human Problem Solving, Englewood Cliffs, N.J.: Prentice-Hall.
Samuel, A.L. (1959). Some studies in machine learning using the game of checkers, IBM Journal, July.
Shannon, C.E. (1950). Programming a computer for playing chess, Philosophical Magazine, 41, 256–275.
Thrun, S. (1995). Learning to play the game of chess. In Tesauro, G., Touretzky, D. and Leen, T. (Eds.), Advances in Neural Information Processing Systems 7, Massachusetts: MIT Press.
Walczak, S. (1992). Pattern-Based Tactical Planning. International Journal of Pattern Recognition and Artificial Intelligence, 6, 955–988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jansen, A.R., Dowe, D.L., Farr, G.E. (2000). Inductive Inference of Chess Player Strategy. In: Mizoguchi, R., Slaney, J. (eds) PRICAI 2000 Topics in Artificial Intelligence. PRICAI 2000. Lecture Notes in Computer Science(), vol 1886. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44533-1_10
Download citation
DOI: https://doi.org/10.1007/3-540-44533-1_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67925-7
Online ISBN: 978-3-540-44533-3
eBook Packages: Springer Book Archive