Moshe Sipper
Achiya Elyasaf
Skip Abstract Section
Abstract
The application of computational intelligence techniques within the vast domain of games has been increasing at a breath-taking speed. Over the past several years our research group has produced a plethora of results in numerous games of different natures, evidencing the success and efficiency of evolutionary algorithms in general --- and genetic programming in particular --- at producing top-notch, human-competitive game strategies. Herein, we describe our study of the game of FreeCell, which produced two Gold Humie Awards. Our top evolved FreeCell player is the best published player to date, able to convincingly beat high-ranking human players.
- F. Bacchus. AIPS'00 planning competition. AI Magazine, 22(1):47--56, 2001.Google Scholar
- Edmund K. Burke, Matthew Hyde, Graham Kendall, Gabriela Ochoa, Ender Ozcan, and John R. Woodward. A classification of hyper-heuristic approaches. In M. Gendreau and J-Y. Potvin, editors, Handbook of Meta-Heuristics 2nd Edition, pages 449--468. Springer, 2010.Google Scholar
- Achiya Elyasaf, Ami Hauptman, and Moshe Sipper. GA-FreeCell: Evolving Solvers for the Game of FreeCell. In N. Krasnogor et al., editors, GECCO '11: Proceedings of the 13th annual conference on Genetic and evolutionary computation, pages 1931--1938, Dublin, Ireland, 12-16 July 2011. ACM. Google ScholarDigital Library
- Achiya Elyasaf, Ami Hauptman, and Moshe Sipper. Evolutionary design of FreeCell solvers. IEEE Transactions on Computational Intelligence and AI in Games, 4(4):270--281, 2012.Google ScholarCross Ref
- Achiya Elyasaf, Yael Zaritsky, Ami Hauptman, and Moshe Sipper. Evolving solvers for FreeCell and the sliding-tile puzzle. In Daniel Borrajo, Maxim Likhachev, and Carlos Linares López, editors, Proceedings of the Fourth Annual Symposium on Combinatorial Search, SOCS 2011. AAAI Press, 2011.Google Scholar
- S. L. Epstein. Game playing: The next moves. In Proceedings of the Sixteenth National Conference on Artificial Intelligence, pages 987--993. AAAI Press, Menlo Park, California USA, 1999. Google ScholarDigital Library
- P. W. Frey. Chess Skill in Man and Machine. Springer-Verlag New York, Inc., Secaucus, NJ, USA, 1979. Google ScholarDigital Library
- P. E. Hart, N. J. Nilsson, and B. Raphael. A formal basis for heuristic determination of minimum path cost. IEEE Transactions on Systems Science and Cybernetics, 4(2):100--107, February 1968.Google ScholarCross Ref
- Patrik Haslum, Blai Bonet, and Hector Geffner. New admissible heuristics for domain-independent planning. In Manuela M. Veloso and Subbarao Kambhampati, editors, AAAI '05: Proceedings, The Twentieth National Conference on Artificial Intelligence and the Seventeenth Innovative Applications of Artificial Intelligence Conference, July 9-13, 2005, Pittsburgh, Pennsylvania, USA, pages 1163--1168. AAAI Press/The MIT Press, 2005. Google ScholarDigital Library
- Ami Hauptman, Achiya Elyasaf, Moshe Sipper, and Assaf Karmon. GP-Rush: using genetic programming to evolve solvers for the Rush Hour puzzle. In GECCO'09: Proceedings of 11th Annual Conference on Genetic and Evolutionary Computation Conference, pages 955--962, New York, NY, USA, 2009. ACM. Google ScholarDigital Library
- R. A. Hearn. Games, Puzzles, and Computation. PhD thesis, Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2006. Google ScholarDigital Library
- G. T. Heineman. Algorithm to solve FreeCell solitaire games, January 2009. http://broadcast.oreilly.com/2009/01/january-column-graph-algorithm.html. Blog column associated with the book "Algorithms in a Nutshell book," by G. T. Heineman, G. Pollice, and S. Selkow, O'Reilly Media, 2008.Google Scholar
- M. Helmert. Complexity results for standard benchmark domains in planning. Artificial Intelligence, 143(2):219--262, 2003. Google ScholarDigital Library
- Malte Helmert. Understanding Planning Tasks: Domain Complexity and Heuristic Decomposition, volume 4929 of Lecture Notes in Computer Science. Springer, 2008. Google ScholarDigital Library
- A. Junghanns and J. Schaeffer. Sokoban: A challenging single-agent search problem. In Workshop on Using Games as an Experimental Testbed for AI Research, Proceedings IJCAI-97, pages 27--36, 1997.Google Scholar
- G. Kendall, A. Parkes, and K. Spoerer. A survey of NP-complete puzzles. ICGA Journal, 31:13--34, 2008.Google ScholarCross Ref
- R. E. Korf. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 27(1):97--109, 1985. Google ScholarDigital Library
- R. E. Korf. Macro-operators: A weak method for learning. Artificial Intelligence, 26:35--77, 1985. Google ScholarDigital Library
- Richard E. Korf. Finding optimal solutions to Rubik's cube using pattern databases. In Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Conference on Innovative Applications of Artificial Intelligence, AAAI'97/IAAI'97, pages 700--705. AAAI Press, 1997. Google ScholarDigital Library
- J. Pearl. Heuristics. Addison--Wesley, Reading, Massachusetts, 1984.Google Scholar
- E. Pednault. ADL: Exploring the middle ground between STRIPS and the situation calculus. In Proceedings of 1st international conference on Principles of Knowledge Representation and Reasoning, pages 324--332, 1989. Google ScholarDigital Library
- E. Robertson and I. Munro. NP-completeness, puzzles and games. Utilas Mathematica, 13:99--116, 1978.Google Scholar
- M. Samadi, A. Felner, and J. Schaeffer. Learning from multiple heuristics. In Dieter Fox and Carla P. Gomes, editors, Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (AAAI 2008), pages 357--362. AAAI Press, 2008. Google ScholarDigital Library
- Moshe Sipper. Evolved to Win. Lulu, 2011. available at http://www.lulu.com/.Google Scholar
- Larry A. Taylor and Richard E. Korf. Pruning duplicate nodes in depth-first search. In Proceedings of the Eleventh National Conference on Artificial Intelligence, AAAI'93, pages 756--761. AAAI Press, 1993. Google ScholarDigital Library
Index Terms
- Lunch isn't free --- but cells are: evolving FreeCell players
Index terms have been assigned to the content through auto-classification.
Recommendations
General video game playing escapes the no free lunch theorem
2017 IEEE Conference on Computational Intelligence and Games (CIG)Popular topics in current research within the games community are general game playing and general video game playing. Both of these efforts seek to find relatively general purpose AI to play games. Within the optimization community we are approaching the ...
Creating play money for free-to-play and gambling games
AcademicMindtrek '16: Proceedings of the 20th International Academic Mindtrek ConferenceIn this paper, we analyze the interview data of sixteen gamblers and free-to-play (F2P) gamers. Both in F2P gaming and gambling, the usage of money influences the game experiences. By focusing on the qualities of money, rather than the quantities of it, ...
Cells of War
Background. Health constitutes a major field in serious games because of the wide range of applications and the significant contribution to humans and society. The spectrum of games for health meets the needs for education, training, treatment, ...
Comments