PushPush is NP-hard in 3D

Details PushPush is NP-hard in 3D PushPush is NP-hard in 3D

1999-11-28

arxiv.org/abs/cs/9911013v1

Computer Science

Computational Geometry

10 pages, 7 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

PushPush is NP-hard in 3D does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with PushPush is NP-hard in 3D, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and PushPush is NP-hard in 3D will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-97293