PushPush-k is PSPACE-Complete

Abstract

We prove that a pushing-block puzzle called PUSHPUSH-k is PSPACE-complete for any fixed k ≥ 1. In this puzzle, a robot moves on a finite grid. Each grid position is either empty or occupied by a single obstacle block. While moving, the robot may push obstacle blocks in direction of its movement, subject to certain constraints. In particular, once an obstacle block starts moving, it continues to do so until it hits another obstacle or the grid boundary. The problem is to decide whether the robot can navigate from a given start position to a specified goal position on the grid.

Extracted Key Phrases

8 Figures and Tables

Cite this paper

@inproceedings{Demaine2004PushPushkIP, title={PushPush-k is PSPACE-Complete}, author={Erik D. Demaine and Michael Hoffmann and Markus Holzer}, year={2004} }