PushPush is NP-hard in 2D

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

2000-01-24

arxiv.org/abs/cs/0001019v1

Computer Science

Computational Geometry

18 pages, 13 figures, 1 table. Improves cs.CG/9911013

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

PushPush is NP-hard in 2D 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 2D, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and PushPush is NP-hard in 2D will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-729735