Evolution of an Efficient Search Algorithm for the Mate-In-N Problem in Chess

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

@InProceedings{eurogp07:hauptman,

• author = "Ami Hauptman and Moshe Sipper",
• title = "Evolution of an Efficient Search Algorithm for the Mate-In-N Problem in Chess",
• editor = "Marc Ebner and Michael O'Neill and Anik\'o Ek\'art and Leonardo Vanneschi and Anna Isabel Esparcia-Alc\'azar",
• booktitle = "Proceedings of the 10th European Conference on Genetic Programming",
• publisher = "Springer",
• series = "Lecture Notes in Computer Science",
• volume = "4445",
• year = "2007",
• address = "Valencia, Spain",
• month = "11-13 " # apr,
• pages = "78--89",
• keywords = "genetic algorithms, genetic programming",
• ISBN = "3-540-71602-5",
• isbn13 = "978-3-540-71602-0",
• DOI = "doi:10.1007/978-3-540-71605-1_8",
• abstract = "We propose an approach for developing efficient search algorithms through genetic programming. Focusing on the game of chess we evolve entire game-tree search algorithms to solve the Mate-In-N problem: find a key move such that even with the best possible counterplays, the opponent cannot avoid being mated in (or before) move N. We show that our evolved search algorithms successfully solve several instances of the Mate-In-N problem, for the hardest ones developing 47percent less game-tree nodes than CRAFTY---a state-of-the-art chess engine with a ranking of 2614 points. Improvement is thus not over the basic alpha-beta algorithm, but over a world-class program using all standard enhancements.",
• notes = "Part of \cite{ebner:2007:GP} EuroGP'2007 held in conjunction with EvoCOP2007, EvoBIO2007 and EvoWorkshops2007",

}

Genetic Programming entries for Ami Hauptman Moshe Sipper

Citations