Abstract
We apply genetic programming to the evolution of strategies for playing the game of backgammon. We explore two different strategies of learning: using a fixed external opponent as teacher, and letting the individuals play against each other. We conclude that the second approach is better and leads to excellent results: Pitted in a 1000-game tournament against a standard benchmark player-Pubeval-our best evolved program wins 62.4% of the games, the highest result to date. Moreover, several other evolved programs attain win percentages not far behind the champion, evidencing the repeatability of our approach.
| Original language | English |
|---|---|
| Pages (from-to) | 283-300 |
| Number of pages | 18 |
| Journal | Genetic Programming and Evolvable Machines |
| Volume | 6 |
| Issue number | 3 |
| DOIs | |
| State | Published - 1 Sep 2005 |
Keywords
- Backgammon
- Genetic programming
- Self-learning
ASJC Scopus subject areas
- Software
- Theoretical Computer Science
- Hardware and Architecture
- Computer Science Applications