Inductive inference of chess player strategy

Anthony R Jansen, David L Dowe, Graham E Farr

    Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

    1 Citation (Scopus)


    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.
    Original languageEnglish
    Title of host publicationPRICAI 2000 Topics in Artificial Intelligence
    Subtitle of host publication6th Pacific Rim International Conference on Artificial Intelligence Melbourne, Australia, August 28 - September 1,2000 Proceedings
    EditorsRiichiro Mizoguchi, John Slaney
    Place of PublicationBerlin Germany
    Number of pages11
    ISBN (Print)3540679251
    Publication statusPublished - 2000
    EventPacific Rim International Conference on Artificial Intelligence 2000 - Melbourne, Australia
    Duration: 28 Aug 20001 Sept 2000
    Conference number: 6th (Proceedings)

    Publication series

    NameLecture Notes in Computer Science
    ISSN (Print)0302-9743


    ConferencePacific Rim International Conference on Artificial Intelligence 2000
    Abbreviated titlePRICAI 2000
    Internet address

    Cite this