PSPACE-Completeness of Sliding-Block Puzzles and Other Problems through the Nondeterministic Constraint Logic Model of Computation

  title={PSPACE-Completeness of Sliding-Block Puzzles and Other Problems through the Nondeterministic Constraint Logic Model of Computation},
  author={Robert A. Hearn and Erik D. Demaine},
  journal={Theor. Comput. Sci.},
We present a nondeterministic model of computation based on reversing edge directions in weighted directed graphs with minimum in-flow constraints on vertices. Deciding whether this simple graph model can be manipulated in order to reverse the direction of a particular edge is shown to be PSPACEcomplete by a reduction from Quantified Boolean Formulas. We prove this result in a variety of special cases including planar graphs and highly restricted vertex configurations, some of which correspond… CONTINUE READING
Highly Influential
This paper has highly influenced 34 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Recent Discussions
This paper has been referenced on Twitter 2 times over the past 90 days. VIEW TWEETS
125 Citations
17 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 125 extracted citations


Publications referenced by this paper.
Showing 1-10 of 17 references

Sokoban is PSPACE-complete

  • Joseph Culberson
  • In Proceedings of the International Conference on…
  • 1998
Highly Influential
4 Excerpts

On the complexity of motion planning for multiple independent objects: PSPACE-hardness of the ‘Warehouseman’s Problem

  • J. E. Hopcroft, J. T. Schwartz, M. Sharir
  • International Journal of Robotics Research,
  • 1984
Highly Influential
6 Excerpts

Re: Is retrograde chess NP-hard

  • Hans Bodlaender
  • Usenet posting to, March
  • 2001
Highly Influential
3 Excerpts

Lectures on Polytopes, lecture 4, pages 103–126

  • Günter M. Ziegler
  • Graduate Texts in Mathematics. Springer-Verlag,
  • 1995
Highly Influential
16 Excerpts

Vorlesungen über die Theorie der Polyeder

  • Ernst Steinitz, Hans Rademacher
  • 1976
Highly Influential
16 Excerpts

Baum . Rush Hour is PSPACE - complete , or “ Why you should generously tip parking lot attendants ”

  • Michael R. Garey
  • Theoretical Computer Science
  • 2002

Similar Papers

Loading similar papers…