D. Dor and U. Zwick [1999], SOKOBAN and other motion planning problems, Comput. Geom. 13, 215-228. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
Finding Optimal Solutions to Atomix - Hüffner (2002) (Correct)
Assembling Molecules in Atomix is Hard - Holzer, Schwoon (2001) (5 citations) (Correct)
Pushing Blocks is NP-Complete for Noncrossing Solution Paths - Demaine, Hoffmann (2001) (3 citations) (Correct)
Pushing Blocks is NP-Complete for Noncrossing Solution Paths - Demaine, Hoffmann (2001) (3 citations) (Correct)
Domain-Dependent Single-Agent Search Enhancements - Junghanns, Schaeffer (1999) (9 citations) (Correct)
Sokoban: A Case-Study in the Application of Domain.. - Junghanns, Schaeffer (2000) (1 citation) (Correct)
Sokoban: Improving the Search with Relevance Cuts - Junghanns, Schaeffer (1999) (Correct)
PushPush and Push-1 are NP-hard in 2D - Demaine, Demaine, O'Rourke (2000) (5 citations) (Correct)
PushPush and Push-1 are NP-hard in 2D - Demaine, O'Rourke (2000) (5 citations) (Correct)
Rush Hour is PSPACE-complete, or "Why you should.. - Gary Flake, Eric Baum (Correct)
Pushing the Limits: New Developments in Single-Agent Search - Junghanns (1999) (7 citations) (Correct)
Domain-Dependent Single-Agent Search Enhancements - Junghanns, Schaeffer (1999) (9 citations) (Correct)
Relevance Cuts: Localizing the Search - Junghanns, Schaeffer (1998) (Correct)
Sokoban is PSPACE-complete - Culberson (1997) (24 citations) (Correct)
Combinatorial Games: Selected Bibliography with a Succinct.. - Fraenkel (2006) (2 citations) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC