Paper by Erik D. Demaine

Reference:

Erik D. Demaine, Martin L. Demaine, and Joseph O'Rourke, “PushPush is NP-hard in 2D”, Technical Report 065, Smith College, January 2000.

BibTeX

@TechReport{PushPush2DTR,
  AUTHOR        = {Erik D. Demaine and Martin L. Demaine and Joseph O'Rourke},
  TITLE         = {PushPush is NP-hard in 2D},
  INSTITUTION   = {Smith College},
  NUMBER        = {065},
  MONTH         = {January},
  YEAR          = 2000,

  LENGTH        = {18 pages},
  COMMENTS      = {This paper is also available as
                   <A HREF="http://arXiv.org/abs/cs.CG/0001019">
                   arXiv:cs.CG/0001019</A> of the
                   <A HREF="http://arXiv.org/archive/cs/intro.html">
                   Computing Research Repository (CoRR)</A>.},
  PAPERS        = {CCCG2000b},
  WEBPAGES      = {pushpush; pushingblocks}
}

Abstract:

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.

Comments:

This paper is also available as arXiv:cs.CG/0001019 of the Computing Research Repository (CoRR).

Length:

The paper is 18 pages.

Availability:

The paper is available in PostScript (719k) and gzipped PostScript (179k).

See information on file formats.

[Google Scholar search]

Related papers:

CCCG2000b (PushPush and Push-1 are NP-hard in 2D)

Related webpages:

PushPush
Pushing Blocks