Genetically programmed strategies for chess endgame

Created by W.Langdon from gp-bibliography.bib Revision:1.4221

  author =       "Nicolas Lassabe and Stephane Sanchez and 
                 Herve Luga and Yves Duthen",
  title =        "Genetically programmed strategies for chess endgame",
  booktitle =    "{GECCO 2006:} Proceedings of the 8th annual conference
                 on Genetic and evolutionary computation",
  year =         "2006",
  editor =       "Maarten Keijzer and Mike Cattolico and Dirk Arnold and 
                 Vladan Babovic and Christian Blum and Peter Bosman and 
                 Martin V. Butz and Carlos {Coello Coello} and 
                 Dipankar Dasgupta and Sevan G. Ficici and James Foster and 
                 Arturo Hernandez-Aguirre and Greg Hornby and 
                 Hod Lipson and Phil McMinn and Jason Moore and Guenther Raidl and 
                 Franz Rothlauf and Conor Ryan and Dirk Thierens",
  volume =       "1",
  ISBN =         "1-59593-186-4",
  pages =        "831--838",
  address =      "Seattle, Washington, USA",
  URL =          "",
  DOI =          "doi:10.1145/1143997.1144144",
  publisher =    "ACM Press",
  publisher_address = "New York, NY, 10286-1405, USA",
  month =        "8-12 " # jul,
  organisation = "ACM SIGEVO (formerly ISGEC)",
  keywords =     "genetic algorithms, genetic programming, chess,
                 evolving strategies",
  size =         "8 pages",
  abstract =     "Classical chess engines exhaustively explore moving
                 possibilities from a chessboard configuration to choose
                 what the next best move to play is. In this article we
                 present a new method to solve chess endgames without
                 using Brute-Force algorithms or endgame tables. We are
                 proposing to use Genetic Programming to combine
                 elementary chess patterns defined by a chess expert. We
                 apply this method specifically to the classical
                 King-Rook-King endgame. We show that computed
                 strategies are both effective and generic for they
                 manage to win against several opponents (human players
                 and artificial ones such as the chess engine CRAFTY).
                 Besides, the method allows to propose strategies that
                 are clearly readable and usable for a purpose such as
                 teaching chess.",
  notes =        "GECCO-2006 A joint meeting of the fifteenth
                 international conference on genetic algorithms
                 (ICGA-2006) and the eleventh annual genetic programming
                 conference (GP-2006).

                 ACM Order Number 910060",

Genetic Programming entries for Nicolas Lassabe Stephane Sanchez Herve Luga Yves Duthen