We apply genetic programming to the evolution of strategies for playing chess endgames. Our evolved programs are able to draw or win against an expert human-based strategy, and draw against CRAFTY—a world-class chess program, which finished second in the 2004 Computer Chess Championship.
—We evolve heuristics to guide staged deepening search for the hard game of FreeCell, obtaining top-notch solvers for this human-challenging puzzle. We first devise several novel heuristic measures using minimal domain knowledge and then use them as building blocks in two evolutionary setups involving a standard genetic algorithm and policy-based, genetic… (More)
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-InN 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… (More)
We use genetic programming to evolve highly successful solvers for two puzzles: Rush Hour and FreeCell. Many NP-Complete puzzles have remained relatively neglected by researchers (see (Kendall, Parkes, and Spoerer 2008) for a review). Among these difficult games we find the Rush Hour puzzle, which was proven to be PSPACE-Complete for the general n×n case… (More)
We evolve heuristics to guide IDA* search for the 6x6 and 8x8 versions of the Rush Hour puzzle, a PSPACE-Complete problem, for which no efficient solver has yet been reported. No effective heuristic functions are known for this domain, and--before applying any evolutionary thinking--we first devise several novel heuristic measures, which improve… (More)
We evolve heuristics to guide staged deepening search for the hard game of FreeCell, obtaining top-notch solvers for this NP-Complete, human-challenging puzzle. We first devise several novel heuristic measures and then employ a Hillis-style coevolutionary genetic algorithm to find efficient combinations of these heuristics. Our results significantly surpass… (More)
We investigate a strong chess endgame player, previously evolved by us through genetic programming . Its performance is analyzed across four games, demonstrating the chess-playing capabilities developed through evolution. We end with a discussion of our GP-evolved player's pros and cons.
We use genetic algorithms to evolve highly successful solvers for two puzzles: FreeCell and Sliding-Tile Puzzle. Discrete puzzles, also known as single-player games, are an excellent problem domain for artificial intelligence research , because they can be parsimoniously described yet are often hard to solve (Pearl 1984). A well-known, highly popular… (More)