PushPush and Push-1 are NP-hard in 2D

Abstract

We prove that two pushing-blocks puzzles are intractable in 2D. One of our constructions improves an earlier result that established intractability in 3D [OS99] for a puzzle inspired by the game PushPush. The second construction answers a question we raised in [DDO00] for a variant we call Push-1. Both puzzles consist of unit square blocks on an integer lattice; all blocks are movable. An agent may push blocks (but never pull them) in attempting to move between given start and goal positions. In the PushPush version, the agent can only push one block at a time, and moreover when a block is pushed it slides the maximal extent of its free range. In the Push-1 version, the agent can only push one block one square at a time, the minimal extent—one square. Both NP-hardness proofs are by reduction from SAT, and rely on a common construction.

Extracted Key Phrases

1 Figure or Table

Statistics

0510'02'04'06'08'10'12'14'16
Citations per Year

64 Citations

Semantic Scholar estimates that this publication has 64 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Demaine2000PushPushAP, title={PushPush and Push-1 are NP-hard in 2D}, author={Erik D. Demaine and Martin L. Demaine and Joseph O'Rourke}, journal={CoRR}, year={2000}, volume={cs.CG/0007021} }