Corpus ID: 2705200

PushPush and Push-1 are NP-hard in 2D

@article{Demaine2000PushPushAP,
  title={PushPush and Push-1 are NP-hard in 2D},
  author={E. Demaine and Martin L. Demaine and J. O'Rourke},
  journal={ArXiv},
  year={2000},
  volume={cs.CG/0007021}
}
  • E. Demaine, Martin L. Demaine, J. O'Rourke
  • Published 2000
  • Computer Science, Mathematics
  • ArXiv
  • We prove that two pushing-blocks puzzles are intractable in 2D. One of our constructions improves an earlier result that established intractability in 3D [OS99] for a puzzle inspired by the game PushPush. The second construction answers a question we raised in [DDO00] for a variant we call Push-1. Both puzzles consist of unit square blocks on an integer lattice; all blocks are movable. An agent may push blocks (but never pull them) in attempting to move between given start and goal positions… CONTINUE READING
    66 Citations
    Push-2-f is pspace-complete
    • 24
    • PDF
    Push-Pull Block Puzzles are Hard
    • 5
    • PDF
    Push-Pull Block Puzzles are Hard
    • 1
    • PDF
    Pull and PushPull are PSPACE-complete
    • 10
    PushPush-k is PSPACE-Complete
    • 14
    • PDF
    Pushing blocks is hard
    • 30
    • PDF
    PSPACE-completeness of Pulling Blocks to Reach a Goal
    • 2
    • PDF
    Solving moving-blocks problems
    Assembling molecules in ATOMIX is hard
    • 27
    • Highly Influenced
    • PDF

    References

    SHOWING 1-10 OF 17 REFERENCES
    PushPush is NP-hard in 2D
    • 10
    • PDF
    Sokoban is PSPACE-complete
    • 135
    SOKOBAN and other motion planning problems
    • 81
    Motion planning in the presence of movable obstacles
    • G. Wilfong
    • Mathematics, Computer Science
    • SCG '88
    • 1988
    • 143
    Rourke and the Smith Problem Solving Group PushPush is NP-hard in 3D Paper cs.CG/9911013, arXiv.org e-print archive
    • Rourke and the Smith Problem Solving Group PushPush is NP-hard in 3D Paper cs.CG/9911013, arXiv.org e-print archive
    • 1999
    CCCG
    • CCCG
    • 2000
    Push-* is NP-hard
    • 15
    Paper cs.CG/9911013, arXiv.org e-print archive
    • Paper cs.CG/9911013, arXiv.org e-print archive
    • 1999
    Problem Solving Group. PushPush is NP-hard in 3D
    • Technical Report 064,
    • 1999