Sokoban: Evaluating standard single-agent search techniques in the presence of deadlock
Single-agent search is a powerful tool for solving a variety of applications. Most of the academic application domains used to explore single-agent search techniques have the property that if you start with a solvable state, at no time in the search can you reach a state that is unsolvable (it may, however, not be minimal). In this paper we address the implications that arise when states in the search are unsolvable. These so-called deadlock states are largely responsible for the failure of our attempts to solve positions in the game of Sokoban.
Keywordssingle agent search heuristic search Sokoban deadlocks IDA
Unable to display preview. Download preview PDF.
- 1.J. Culberson. Sokoban is PSPACE-complete. Technical Report TR 97-02, Dept. of Computing Science, University of Alberta, 1997. Also: http://web.cs.ualberta.ca/-joe/Preprints/Sokoban.Google Scholar
- 2.J. Culberson and J. Schaeffer. Searching with pattern databases. In G. McCalla, editor, Advances in Artificial Intelligence, pages 402–416. Springer-Verlag, 1996. Proceedings of CSCSI'95.Google Scholar
- 3.D. Dor and U. Zwick. SOKOBAN and other motion planing problems, 1995. At: http://www.math.tau.ac.il/-ddorit.Google Scholar
- 4.M. Ginsberg. Partition search. In Proceedings of the National Conference on Artificial Intelligence (AAAI-96), pages 228–233, 1996.Google Scholar
- 6.M Klein. A primal method for minimal cost flows. Management Science, 14:205–220, 1967.Google Scholar
- 10.R.E. Korf. Finding optimal solutions to Rubik's Cube using pattern databases. In AAAI National Conference, pages 700–705, 1997.Google Scholar
- 11.H.W. Kuhn. The Hungarian method for the assignment problem. Naval Res. Logist. Quart., pages 83–98, 1955.Google Scholar
- 13.D. Slate and L. Atkin. Chess 4.5 — The Northwestern University chess program. In P.W. Frey, editor, Chess Skill in Man and Machine, pages 82–118, New York, 1977. Springer-Verlag.Google Scholar
- 14.G. Wilfong. Motion planning in the presence of movable obstacles. In 4th ACM Symposium on Computational Geometry, pages 279–288, 1988.Google Scholar