Ami Hauptman
Achiya Elyasaf
ABSTRACT
We evolve heuristics to guide IDA* search for the 6x6 and 8x8 versions of the Rush Hour puzzle, a PSPACE-Complete problem, for which no efficient solver has yet been reported. No effective heuristic functions are known for this domain, and--before applying any evolutionary thinking--we first devise several novel heuristic measures, which improve (non-evolutionary) search for some instances, but hinder search substantially for many other instances. We then turn to genetic programming (GP) and find that evolution proves immensely efficacious, managing to combine heuristics of such highly variable utility into composites that are nearly always beneficial, and far better than each separate component. GP is thus able to beat both the human player of the game and also the human designers of heuristics.
- R. Aler, D. Borrajo, and P. Isasi. Evolving heuristics for planning. Lecture Notes in Computer Science, 1447:745--754, 1998. Google Scholar
Digital Library
- R. Aler, D. Borrajo, and P. Isasi. Learning to solve planning problems efficiently by means of genetic programming. Evolutionary Computation, 9(4):387--420, Winter 2001. Google ScholarDigital Library
- R. Aler, D. Borrajo, and P. Isasi. Using genetic programming to learn and improve knowledge. Artificial Intelligence, 141(1-2):29--56, 2002. Google ScholarDigital Library
- D. Borrajo and M. M. Veloso. Lazy incremental learning of control knowledge for efficiently obtaining quality plans. Artif. Intell. Rev, 11(1-5):371--405, 1997. Google ScholarDigital Library
- A. Botea, M. Muller, and J. Schaeffer. Using abstraction for planning in Sokoban. In CG: International Conference on Computers and Games. LNCS, 2003.Google Scholar
- S. Collette, J.-F. Raskin, and F. Servais. On the symbolic computation of the hardest configurations of the Rush Hour game. In Proc. of the 5th International Conference on Computers and Games, LNCS 4630, pages 220--233. Springer-Verlag, 2006. Google ScholarDigital Library
- J. C. Culberson and J. Schaeffer. Searching with pattern databases. In G. McCalla, editor, Proceedings of the Eleventh Biennial Conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence, volume 1081 of LNAI, pages 402--416, Berlin, May 21-24 1996. Springer. Google ScholarDigital Library
- A. Felner, R. E. Korf, and S. Hanan. Additive pattern database heuristics. J. Artif. Intell. Res. (JAIR), 22:279--318, 2004. Google ScholarDigital Library
- H. Fernau, T. Hagerup, N. Nishimura, P. Ragde, and K. Reinhardt. On the parameterized complexity of the generalized Rush Hour puzzle. In Canadian Conference on Computational Geometry, pages 6--9, 2003.Google Scholar
- G. W. Flake and E. B. Baum. Rush Hour is pspace-complete, or "why you should generously tip parking lot attendant". Theor. Comput. Sci., 270(1-2):895--911, 2002. Google ScholarDigital Library
- P. W. Frey. Chess Skill in Man and Machine. Springer-Verlag New York, Inc., Secaucus, NJ, USA, 1979. Google ScholarDigital Library
- O. Hansson, A. Mayer, and M. Yung. Criticizing solutions to relaxed models yields powerful admissible heuristics. Information Sciences, 63(3):207--227, Sept. 1992. Google ScholarDigital Library
- P. E. Hart, N. J. Nilsson, and B. Raphael. A formal basis for heuristic determination of minimum path cost. IEEE Trans. on SSC, 4:100, 1968.Google Scholar
- R. A. Hearn. Games, puzzles, and computation. PhD thesis, Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2006. Google ScholarDigital Library
- R. A. Hearn and E. D. Demaine. Pspace-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation. Theoretical Computer Science, 343(1-2):72--96, 2005. Google ScholarDigital Library
- A. Junghanns and J. Schaeffer. Sokoban: A challenging single-agent search problem. In IJCAI, pages 27--36. Universiteit, 1997.Google Scholar
- A. Junghanns and J. Schaeffer. Domain--dependent single--agent search enhancements. In T. Dean, editor, Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI 99, Stockholm, Sweden, July 31 - August 6, 1999. 2 Volumes, 1450 pages, pages 570--577. Morgan Kaufmann, 1999. Google ScholarDigital Library
- A. Junghanns and J. Schaeffer. Sokoban: Improving the search with relevance cuts. TCS: Theoretical Computer Science, 252, 2001. Google ScholarDigital Library
- G. Kendall, A. Parkes, and K. Spoerer. A survey of NP-complete puzzles. International Computer Games Association Journal (ICGA), 31:13--34, 2008.Google Scholar
- 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
- R. E. Korf. Finding optimal solutions to rubik's cube using pattern databases. In AAAI/IAAI, pages 700--705, 1997. Google ScholarDigital Library
- R. E. Korf and A. Felner. Disjoint pattern database heuristics. AIJ: Artificial Intelligence, 134, 2002. Google ScholarDigital Library
- J. R. Koza. Genetic Programming II: Automatic Discovery of Reusable Programs. MIT Press, Cambridge Massachusetts, May 1994. Google ScholarDigital Library
- J. Levine and D. Humphreys. Learning action strategies for planning domains using genetic programming. In G. R. Raidl, J.-A. Meyer, M. Middendorf, S. Cagnoni, J. J. R. Cardalda, D. Corne, J. Gottlieb, A. Guillot, E. Hart, C. G. Johnson, and E. Marchiori, editors, EvoWorkshops, volume 2611 of Lecture Notes in Computer Science, pages 684--695. Springer, 2003. Google ScholarDigital Library
- D. J. Montana. Strongly typed genetic programming. Evolutionary Computation, 3(2):199--230, 1995. Google ScholarDigital Library
- J. Pearl. Heuristics. Addison-Wesley, Reading, Massachusetts, 1984.Google Scholar
- E. P. D. Pednault. Adl: exploring the middle ground between strips and the situation calculus. In Proceedings of the first international conference on Principles of knowledge representation and reasoning, pages 324--332, San Francisco, CA, USA, 1989. Morgan Kaufmann Publishers Inc. Google ScholarDigital Library
- A. Reinefeld and T. A. Marsland. Enhanced iterative-deepening search. IEEE Transactions on Pattern Analysis and Machine Intelligence, 16(7):701--710, 1994. Google ScholarDigital Library
- E. Robertson and I. Munro. NP-completeness, puzzles and games. Utilas Mathematica, 13:99--116, 1978.Google Scholar
- S. J. Russell and P. Norvig. Artificial Intelligence: A Modern Approach. Prentice-Hall, Englewood Cliffs, NJ, 1995. Google ScholarDigital Library
- F. Servais. Private communication.Google Scholar
- L. A. Taylor and R. E. Korf. Pruning duplicate nodes in depth-first search. In AAAI, pages 756--761, 1993.Google Scholar
Index Terms
- GP-rush: using genetic programming to evolve solvers for the rush hour puzzle
Recommendations
GA-FreeCell: evolving solvers for the game of FreeCell
GECCO '11: Proceedings of the 13th annual conference on Genetic and evolutionary computationWe evolve heuristics to guide staged deepening search for the hard game of FreeCell, obtaining top-notch solvers for this NP-Complete, human-challenging puzzle. We first devise several novel heuristic measures and then employ a Hillis-style ...
HH-evolver: a system for domain-specific, hyper-heuristic evolution
GECCO '13 Companion: Proceedings of the 15th annual conference companion on Genetic and evolutionary computationWe present HH-Evolver, a tool for domain-specific, hyper-heuristic evolution. HH-Evolver automates the design of domain-specific heuristics for planning domains. Hyper-heuristics generated by our tool can be used with combinatorial search algorithms ...
Automatic Discovery of Optimisation Search Heuristics for Two Dimensional Strip Packing Using Genetic Programming
Simulated Evolution and LearningAbstractThis paper presents a genetic programming based hyper-heuristic (GPHH) for automatic discovery of optimisation heuristics for the two dimensional strip packing problem (2D-SPP). The novelty of this method is to integrate both the construction and ...
Comments