PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation

Theoretical Computer Science

Volumn 343, Issue 1-2, 2005, Pages 72-96

  Hearn, Robert A ^a   Demaine, Erik D ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Combinatorial puzzles; Computational complexity; Hardness; Sliding blocks

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; GRAPH THEORY; MATHEMATICAL MODELS; MOTION PLANNING;

COMBINATORIAL PUZZLES; SLIDING BLOCKS; VERTEX CONFIGURATIONS;

PROBLEM SOLVING;

EID: 25444523204     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.05.008     Document Type: Article

References (13)

1. H. Bodlaender, Re: Is retrograde chess NP-hard? Usenet posting to rec.games.abstract, March 16, 2001.
2. J. Culberson Sokoban is PSPACE-complete Proc. Internat. Conf. on Fun with Algorithms Elba, Italy June 1998 65 76
3. E.D. Demaine, Playing games with algorithms: algorithmic combinatorial game theory, in: J. Sgall, A. Pultr, P. Kolman (Eds.), Proc. 26th Symp. on Mathematical Foundations in Computer Science (MFCS 2001), Vol. 2136, Lecture Notes in Computer Science, Marianske Lazne, Czech Republic, August 27-31, 2001, pp. 18-32.
4. G.W. Flake, and E.B. Baum Rush Hour is PSPACE-complete, or Why you should generously tip parking lot attendants Theoret. Comput. Sci. 270 1-2 2002 895 911
5. M.R. Garey, and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 W. H. Freeman & Co. New York, NY
6. J.E. Hopcroft, J.T. Schwartz, and M. Sharir On the complexity of motion planning for multiple independent objects: PSPACE-hardness of the 'Warehouseman's Problem' Int. J. Robot. Res. 3 4 1984 76 88
7. E. Hordern Sliding Piece Puzzles 1986 Oxford University Press Oxford
8. W.J. Savitch Relationships between nondeterministic and deterministic tape complexities J. Comput. Syst. Sci. 4 2 1970 177 192
9. T.J. Schaefer Complexity of decision problems based on finite two-person perfect-information games Proc. Eighth Annual ACM Symp. on Theory of Computing 1976 ACM Press Hershey, PA 41 49
10. E. Steinitz, and H. Rademacher Vorlesungen über die Theorie der polyeder 1934 Springer Berlin (reprinted 1976)
11. J. Tromp, On size 2 Rush Hour Logic, Manuscript, December 2000, http://turing.wins.uva.nl/~peter/teaching/tromprh.ps.
12. J. Tromp, R. Cilibrasi, Limits of Rush Hour Logic complexity, Manuscript, June 2004, http://www.cwi.nl/~tromp/rh.ps.
13. G.M. Ziegler Lectures on polytopes, lecture 4 Graduate Texts in Mathematics 1995 Springer New York 103 126