21 v 2 3 S ep 2 00 0 PushPush and Push - 1 are NP - hard in 2 D

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… (More)

Topics

13 Figures and Tables

Cite this paper

@inproceedings{Demaine200621V2, title={21 v 2 3 S ep 2 00 0 PushPush and Push - 1 are NP - hard in 2 D}, author={Erik D. Demaine and Martin L. Demaine and Joseph G. O’Rourke}, year={2006} }