Let the Games Evolve!
I survey my group’s results over the past six years within the game area, demonstrating continual success in evolving winning strategies for challenging games and puzzles, including: chess, backgammon, Robocode, lose checkers, simulated car racing, Rush Hour, and FreeCell.
Keywordsbackgammon chess FreeCell lose checkers policy RARS Robocode Rush Hour
Unable to display preview. Download preview PDF.
- Azaria, Yaniv and Sipper, Moshe (2005a). GP-gammon: Genetically programming backgammon players. Genetic Programming and Evolvable Machines, 6(3):283–300. Published online: 12 August 2005.Google Scholar
- Azaria, Yaniv and Sipper, Moshe (2005b). Using GP-gammon: Using genetic programming to evolve backgammon players. In Keijzer, Maarten et al., editors, Proceedings of the 8th European Conference on Genetic Programming, volume 3447 of Lecture Notes in Computer Science, pages 132–142, Lausanne, Switzerland. Springer.Google Scholar
- Benbassat, Amit and Sipper, Moshe (2010). Evolving lose-checkers players using genetic programming. In IEEE Conference on Computational Intelligence and Game, pages 30–37, IT University of Copenhagen, Denmark.Google Scholar
- Burke, E. K., Hyde, M., Kendall, G., Ochoa, G., Ozcan, E., and Woodward, J. R. (2010). A classification of hyper-heuristic approaches. In Gendreau, M. and Potvin, J-Y., editors, Handbook of Meta-Heuristics 2nd Edition, pages 449–468. Springer.Google Scholar
- Chomsky, N. (1993). Language and Thought. Moyer Bell, Wakefield, RI.Google Scholar
- Elyasaf, A., Hauptman, A., and Sipper, M. (2011). GA-FreeCell: Evolving solvers for the game of FreeCell. In GECCO 2011: Proceedings of the Genetic and Evolutionary Computation Conference, New York, NY, USA. ACM. (accepted).Google Scholar
- Epstein, S. L. (1999). Game playing: The next moves. In Proceedings of the Sixteenth National Conference on Artificial Intelligence, pages 987–993. AAAI Press, Menlo Park, California USA.Google Scholar
- Hauptman, A. and Sipper, M. (2007a). Emergence of complex strategies in the evolution of chess endgame players. Advances in Complex Systems, 10(suppl. no. 1):35–59.Google Scholar
- Hauptman, Ami, Elyasaf, Achiya, Sipper, Moshe, and Karmon, Assaf (2009). GP-rush: using genetic programming to evolve solvers for the rush hour puzzle. In Raidl, Guenther et al., editors, GECCO ’09: Proceedings of the 11th Annual conference on Genetic and evolutionary computation, pages 955–962, Montreal. ACM.Google Scholar
- Hauptman, Ami and Sipper, Moshe (2005a). Analyzing the intelligence of a genetically programmed chess player. In Rothlauf, Franz, editor, Late breaking paper at Genetic andEvolutionaryComputationConference(GECCO’2005), Washington, D.C., USA.Google Scholar
- Hauptman, Ami and Sipper, Moshe (2005b). GP-endchess: Using genetic programming to evolve chess endgame players. InKeijzer,Maarten et al., editors, Proceedings of the 8th European Conference on Genetic Programming, volume 3447 of Lecture Notes in Computer Science, pages 120–131, Lausanne, Switzerland. Springer.Google Scholar
- Hauptman, Ami and Sipper, Moshe (2007b). Evolution of an efficient search algorithm for the mate-in-N problem in chess. In Ebner, Marc et al., editors, Proceedings of the 10th European Conference on Genetic Programming, volume 4445 of Lecture Notes in Computer Science, pages 78–89, Valencia, Spain. Springer.Google Scholar
- Hearn,R.A. (2006).Games, puzzles, and computation.PhDthesis,Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science. Heineman, G. T. (2009). Algorithm to solve FreeCell solitaire games. Blog column associated with the book “Algorithms in a Nutshell book,” by G. T. Heineman, G. Pollice, and S. Selkow, O’Reilly Media, 2008. http://broadcast.oreilly.com/2009/01/january-column-graph-algorithm.html.
- Hlynka, M. and Schaeffer, J. (2006). Automatic generation of search engines. In Advances in Computer Games, pages 23–38.Google Scholar
- Kendall, G., Parkes, A., and Spoerer, K. (2008). A survey of NP-complete puzzles. InternationalComputerGamesAssociation Journal (ICGA), 31:13– 34.Google Scholar
- 36 Genetic Programming Theory and Practice IX Google Scholar
- Kendall,G. andWhitwell,G. (2001).An evolutionary approach for the tuning of a chess evaluation function using population dynamics. In Proceedings of the 2001 Congress on Evolutionary Computation (CEC2001), pages 995–1002. IEEE Press.Google Scholar
- Koza, John R. (1992). Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, USA.Google Scholar
- Samadi,M., Felner, A., and Schaeffer, J. (2008). Learning from multiple heuristics. In Fox, Dieter and Gomes, Carla P., editors, Proceedings of the Twenty- Third AAAI Conference on Artificial Intelligence (AAAI 2008), pages 357– 362. AAAI Press.Google Scholar
- Shichel, Y. and Sipper, M. (2011). GP-RARS: Evolving controllers for the Robot Auto Racing Simulator. Memetic Computing. (accepted).Google Scholar
- Shichel, Yehonatan, Ziserman, Eran, and Sipper, Moshe (2005). GP-robocode: Using genetic programming to evolve robocode players. In Keijzer, Maarten et al., editors, Proceedings of the 8th European Conference on Genetic Programming, volume 3447 of Lecture Notes in Computer Science, pages 143– 154, Lausanne, Switzerland. Springer.Google Scholar
- Smith, M. and Sailer, F. (2004). Learning to beat the world Lose Checkers champion using TDLeaf(λ).Google Scholar