Corpus ID: 2705200

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

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

E. Demaine, Martin L. Demaine, J. O'Rourke

Published 2000

Computer Science, Mathematics

ArXiv

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… CONTINUE READING

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed