Chess Endgame Algorithm Generated by Genetic Programming

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

@Misc{Lassabe-chessend_game_eurogp_2006,

• author = "Nicolas Lassabe and Stephane Sanchez and Herve Luga and Yves Duthen",
• title = "Chess Endgame Algorithm Generated by Genetic Programming",
• howpublished = "From Herve Luga",
• year = "2006",
• note = "Not published",
• keywords = "genetic algorithms, genetic programming",
• size = "14 pages",
• abstract = "This article presents a new method to resolve the chess endgame without Brute-Force. In general the chess program need to explore all the possibility of a position or use generated end-table to give the good move. We propose a new method using elementary chess patterns of end-games defined by the chess-player and we compose them by genetic programming to get a method of resolution of this end-game. The results show that this method generates general strategy for all positions and versus opponent strategies.",
• notes = "By email August 2014. Published as \cite{1144144}",

}

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

Citations