Paper by Erik D. Demaine
- Erik D. Demaine, Isaac Grosof, and Jayson Lynch, “Push-Pull Block Puzzles are Hard”, in Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC 2017), Lecture Notes in Computer Science, volume 10236, Athens, Greece, May 24–26, 2017, pages 177–195.
This paper proves that push-pull block puzzles in 3D are PSPACE-complete to solve, and push-pull block puzzles in 2D with thin walls are NP-hard to solve, settling an open question . Push-pull block puzzles are a type of recreational motion planning problem, similar to Sokoban, that involve moving a ‘robot’ on a square grid with 1 × 1 obstacles. The obstacles cannot be traversed by the robot, but some can be pushed and pulled by the robot into adjacent squares. Thin walls prevent movement between two adjacent squares. This work follows in a long line of algorithms and complexity work on similar problems [3–9, 14, 16, 18]. The 2D push-pull block puzzle shows up in the video games Pukoban as well as The Legend of Zelda: A Link to the Past, giving another proof of hardness for the latter . This variant of block-pushing puzzles is of particular interest because of its connections to reversibility, since any action (e.g., push or pull) can be inverted by another valid action (e.g., pull or push).
- The paper is 19 pages.
- The paper is available in PDF (429k).
- See information on file formats.
- [Google Scholar search]
See also other papers by Erik Demaine.
These pages are generated automagically from a
Last updated May 7, 2018 by