Sciweavers

Share
GECCO
2006
Springer

Genetically programmed strategies for chess endgame

10 years 2 months ago
Genetically programmed strategies for chess endgame
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 useable for a purpose such as teaching chess. Categories and Subject Descriptors Algorithm [Genetic Programming] Keywords chess, Genetic Programming, evolving strategies
Nicolas Lassabe, Stéphane Sanchez, Herv&eac
Added 23 Aug 2010
Updated 23 Aug 2010
Type Conference
Year 2006
Where GECCO
Authors Nicolas Lassabe, Stéphane Sanchez, Hervé Luga, Yves Duthen
Comments (0)
books