论文信息 - Evolving Chess Playing Programs

Evolving Chess Playing Programs

This contribution introduces a hybrid GP/ES system for the evolution of chess playing computer programs. We discuss the basic system and examine its performance in comparison to pre-existing algorithms of the type alpha-beta and its improved variants. We can show that evolution is able to outperform these algorithms both in terms of efficiency and strength.

Wolfgang Banzhaf | Roderich Groß | Keno Albrecht | Wolfgang Kantschik

[1] D. Beal. The nature of minimax search , 1999 .

[2] Peter Nordin,et al. Genetic programming - An Introduction: On the Automatic Evolution of Computer Programs and Its Applications , 1998 .

[3] Jonathan Schaeffer,et al. The History Heuristic and Alpha-Beta Search Enhancements in Practice , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[4] Richard E. Korf,et al. Does Deep Blue use Artificial Intelligence? , 1997, J. Int. Comput. Games Assoc..

[5] P. Kent,et al. Tree-searching and tree-pruning techniques , 1988 .

[6] Wolfgang Banzhaf,et al. Linear-Tree GP and Its Comparison with Other GP Structures , 2001, EuroGP.

[7] George Coulouris,et al. Distributed systems - concepts and design , 1988 .

[8] Wolfgang Banzhaf,et al. Linear-Graph GP - A New GP Structure , 2002, EuroGP.

[9] Jonathan Schaeffer,et al. Best-First Fixed-Depth Minimax Algorithms , 1996, J. Int. Comput. Games Assoc..

[10] Hans-Paul Schwefel,et al. Evolution and optimum seeking , 1995, Sixth-generation computer technology series.

[11] Hiroyuki Iida,et al. Tutoring Strategies in Game-Tree Search , 1995, J. Int. Comput. Games Assoc..

[12] Peter Nordin,et al. Evolving Turing-Complete Programs for a Register Machine with Self-modifying Code , 1995, ICGA.