Artificial Intelligence
Genetic programming II: automatic discovery of reusable programs
Genetic programming II: automatic discovery of reusable programs
Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
Evolving recursive programs for tree search
Advances in genetic programming
Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
Deep Blue's contribution to AI
Annals of Mathematics and Artificial Intelligence
Evolving Chess Playing Programs
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
A survey of enhancements to the alpha-beta algorithm
ACM '81 Proceedings of the ACM '81 conference
Adversarial Search by Evolutionary Computation
Evolutionary Computation
Chess endgames: 6-man data and strategy
Theoretical Computer Science - Advances in computer games
GP-EndChess: using genetic programming to evolve chess endgame players
EuroGP'05 Proceedings of the 8th European conference on Genetic Programming
Genetic algorithms for mentor-assisted evaluation function optimization
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Evolving strategy for a probabilistic game of imperfect information using genetic programming
Genetic Programming and Evolvable Machines
Simulating human grandmasters: evolution and coevolution of evaluation functions
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Coevolutionary temporal difference learning for Othello
CIG'09 Proceedings of the 5th international conference on Computational Intelligence and Games
Winning ant wars: evolving a human-competitive game strategy using fitnessless selection
EuroGP'08 Proceedings of the 11th European conference on Genetic programming
Human-competitive results produced by genetic programming
Genetic Programming and Evolvable Machines
Expert-driven genetic algorithms for simulating evaluation functions
Genetic Programming and Evolvable Machines
Optimizing the performance of GNU-chess with a genetic algorithm
Proceedings of the 13th International Conference on Humans and Computers
Evolving small-board Go players using coevolutionary temporal difference learning with archives
International Journal of Applied Mathematics and Computer Science
An evolutionary algorithm with a history mechanism for tuning a chess evaluation function
Applied Soft Computing
| Hi-index | 0.00 |
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 47% less gametree 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.