PushPush is NP-hard in 2D

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We prove that a particular pushing-blocks puzzle is intractable in 2D, improving an earlier result that established intractability in 3D [OS99]. 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 2D by reduction from SAT.
18 pages, 13 figures, 1 table. Improves cs.CG/9911013

Keywords

Computational Geometry, Discrete Mathematics, F.2.2; G.2.m

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/30139

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0001019
 http://arxiv.org/abs/cs/0001019

Collections

arXiv