Pushing Blocks without Fixed Walls via Checkable Gizmos: Push-1 is PSPACE-Complete

Documenti analoghi

• Pushing Blocks via Checkable Gadgets: PSPACE-completeness of Push-1F and Block/Box Dude
  di: Ani, Hayashi, et al.
  Pubblicazione: (2024)
• ASP-Completeness of Hamiltonicity in Grid Graphs, with Applications to Loop Puzzles
  di: MIT Hardness Group, et al.
  Pubblicazione: (2024)
• Walking through Doors is Hard, even without Staircases: Universality and PSPACE-hardness of Planar Door Gadgets
  di: MIT Gadgets Group, et al.
  Pubblicazione: (2020)
• Tetris is Hard with Just One Piece Type
  di: MIT Hardness Group, et al.
  Pubblicazione: (2026)
• PSPACE-Hard 2D Super Mario Games: Thirteen Doors
  di: MIT Hardness Group, et al.
  Pubblicazione: (2024)