Abstract
We apply genetic programming to the evolution of strategies for playing the game of backgammon. Pitted in a 1000-game tournament against a standard benchmark player—Pubeval—our best evolved program wins 58% of the games, the highest verifiable result to date. Moreover, several other evolved programs attain win percentages not far behind the champion, evidencing the repeatability of our approach.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Yao, X.: Evolving artificial neural networks. Proceedings of the IEEE 87, 1423–1447 (1999)
Koza, J.R.: Genetic programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)
Dahl, F.: JellyFish Backgammon (1998-2004), http://www.jellyfish-backgammon.com
Tesauro, G.: Temporal difference learning and TD-Gammon. Communications of the ACM 38, 58–68 (1995)
Pollack, J.B., Blair, A.D., Land, M.: Coevolution of a backgammon player. In: Langton, C.G., Shimohara, K. (eds.) Artificial Life V: Proceedings of the Fifth International Workshop on the Synthesis and Simulation of Living Systems, pp. 92–98. MIT Press, Cambridge (1997)
Sanner, S., Anderson, J.R., Lebiere, C., Lovett, M.: Achieving efficient and cognitively plausible learning in backgammon. In: Langley, P. (ed.) Proceedings of the 17th International Conference on Machine Learning (ICML-2000), Stanford, CA, pp. 823–830. Morgan Kaufmann, San Francisco (2000)
Anderson, J.R., Lebiere, C.: The Atomic Components of Thought. Lawrence Erlbaum Associates, Mahwah (1998)
Qi, D., Sun, R.: Integrating reinforcement learning, bidding and genetic algorithms. In: Proceedings of the International Conference on Intelligent Agent Technology (IAT-2003), pp. 53–59. IEEE Computer Society Press, Los Alamitos (2003)
Montana, D.J.: Strongly typed genetic programming. Evolutionary Computation 3, 199–230 (1995)
Chellapilla, K.: A preliminary investigation into evolving modular programs without subtree crossover. In: Koza, J.R., Banzhaf, W., Chellapilla, K., Deb, K., Dorigo, M., Fogel, D.B., Garzon, M.H., Goldberg, D.E., Iba, H., Riolo, R. (eds.) Genetic Programming 1998: Proceedings of the Third Annual Conference. University of Wisconsin, Madison, Wisconsin, USA, pp. 23–31. Morgan Kaufmann, San Francisco (1998)
Tesauro, G.: Software–Source Code Benchmark player “pubeval.c” (1993), http://www.bkgm.com/rgb/rgb.cgi?view+610
Luke, S.: ECJ: A Java-based Evolutionary Computation and Genetic Programming Research System (2000), http://www.cs.umd.edu/projects/plus/ec/ecj/
Sipper, M.: A success story or an old wives’ tale? On judging experiments in evolutionary computation. Complexity 5, 31–33 (2000)
Koza, J.R.: Genetic Programming II: Automatic Discovery of Reusable Programs. MIT Press, Cambridge (1994)
Koza, J.R., Bennett III, F.H., Andre, D., Keane, M.A.: Genetic Programming III: Darwinian Invention and Problem Solving. Morgan Kaufmann, San Francisco (1999)
Koza, J.R., Keane, M.A., Streeter, M.J., Mydlowec, W., Yu, J., Lanza, G.: Genetic Programming IV: Routine Human-Competitive Machine Intelligence. Kluwer Academic Publishers, Norwell (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Azaria, Y., Sipper, M. (2005). GP-Gammon: Using Genetic Programming to Evolve Backgammon Players. In: Keijzer, M., Tettamanzi, A., Collet, P., van Hemert, J., Tomassini, M. (eds) Genetic Programming. EuroGP 2005. Lecture Notes in Computer Science, vol 3447. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31989-4_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-31989-4_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25436-2
Online ISBN: 978-3-540-31989-4
eBook Packages: Computer ScienceComputer Science (R0)