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.


Presented at:
GECCO 2002, New York
Year:
2002
Publisher:
San Francisco, CA, Morgan Kaufmann
Keywords:
Laboratories:




 Record created 2008-04-01, last modified 2018-09-13

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)