PushPush is NP-hard in 3D
| dc.creator | O'Rourke, Joseph | |
| dc.creator | Group, The Smith Problem Solving | |
| dc.date | 1999-11-28 | |
| dc.date.accessioned | 2026-07-07T03:24:28Z | |
| dc.date.available | 2026-07-07T03:24:28Z | |
| dc.description | We prove that a particular pushing-blocks puzzle is intractable in 3D. The puzzle, inspired by the game PushPush, consists of unit square blocks on an integer lattice. 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, each block, when pushed, slides the maximal extent of its free range. We prove this version is NP-hard in 3D by reduction from SAT. The corresponding problem in 2D remains open. | |
| dc.description | 10 pages, 7 figures | |
| dc.identifier | https://arxiv.org/abs/cs/9911013 | |
| dc.identifier | http://arxiv.org/abs/cs/9911013 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/33335 | |
| dc.subject | Computational Geometry | |
| dc.subject | Discrete Mathematics | |
| dc.subject | F.2.2 | |
| dc.title | PushPush is NP-hard in 3D | |
| dc.type | text |