The Internet Archive has a preservation copy of this work in our general collections. The file type is <code>application/pdf</code>.
PSPACE-Completeness of Sliding-Block Puzzles and Other Problems through the Nondeterministic Constraint Logic Model of Computation
[article]
<span title="2004-11-11">2004</span>
<i >
arXiv
</i>
<span class="release-stage" >pre-print</span>
Preserved Fulltext
Other Versions
<span title="2002-05-04">2002</span>
<span class="release-stage" >pre-print</span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/0205005v1">arXiv:cs/0205005v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xip43nfwtzfzhggur35zvj4aom">fatcat:xip43nfwtzfzhggur35zvj4aom</a> </span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/0205005v1">arXiv:cs/0205005v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xip43nfwtzfzhggur35zvj4aom">fatcat:xip43nfwtzfzhggur35zvj4aom</a> </span>
<span title="2002-06-01">2002</span>
<span class="release-stage" >pre-print</span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/0205005v2">arXiv:cs/0205005v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xzgh3ns6mnetdjygknrk6vllfq">fatcat:xzgh3ns6mnetdjygknrk6vllfq</a> </span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/0205005v2">arXiv:cs/0205005v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xzgh3ns6mnetdjygknrk6vllfq">fatcat:xzgh3ns6mnetdjygknrk6vllfq</a> </span>
<span title="2003-08-31">2003</span>
<span class="release-stage" >pre-print</span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/0205005v3">arXiv:cs/0205005v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nu4cj7pjlfau3kpal6qaraibpm">fatcat:nu4cj7pjlfau3kpal6qaraibpm</a> </span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/0205005v3">arXiv:cs/0205005v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nu4cj7pjlfau3kpal6qaraibpm">fatcat:nu4cj7pjlfau3kpal6qaraibpm</a> </span>
<span title="2004-11-11">2004</span>
<span class="release-stage" >pre-print</span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/0205005v4">arXiv:cs/0205005v4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6nmjyuz35jdgjetmdsys3vtroe">fatcat:6nmjyuz35jdgjetmdsys3vtroe</a> </span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/0205005v4">arXiv:cs/0205005v4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6nmjyuz35jdgjetmdsys3vtroe">fatcat:6nmjyuz35jdgjetmdsys3vtroe</a> </span>
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 PSPACE-complete 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
<span class="external-identifiers">
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/0205005v5">arXiv:cs/0205005v5</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ozdyozcsgnh3fl2imiknvudany">fatcat:ozdyozcsgnh3fl2imiknvudany</a>
</span>
more »
... to a kind of passive constraint logic. Our framework is inspired by (and indeed a generalization of) the "Generalized Rush Hour Logic" developed by Flake and Baum. We illustrate the importance of our model of computation by giving simple reductions to show that several motion-planning problems are PSPACE-hard. Our main result along these lines is that classic unrestricted sliding-block puzzles are PSPACE-hard, even if the pieces are restricted to be all dominoes (1x2 blocks) and the goal is simply to move a particular piece. No prior complexity results were known about these puzzles. This result can be seen as a strengthening of the existing result that the restricted Rush Hour puzzles are PSPACE-complete, of which we also give a simpler proof. Finally, we strengthen the existing result that the pushing-blocks puzzle Sokoban is PSPACE-complete, by showing that it is PSPACE-complete even if no barriers are allowed.
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-cs0205005/cs0205005.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
File Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/37/ce/37cedfa20b40ca609bf21b22b4add9a3087f535b.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/0205005v5" title="arxiv.org access">
<button class="ui compact blue labeled icon button serp-button">
<i class="file alternate outline icon"></i>
arxiv.org
</button>
</a>