Puzznic is PSPACE-Complete
The authors prove that Puzznic is PSPACE-complete and improve the NP-completeness proof for a simpler version of the game, Cubic.
The authors improve the NP-completeness proof for Cubic and prove Puzznic's PSPACE-completeness, which is a more general and stronger result.
Before reading this…
To understand this paper, make sure you know these concepts first:
- Computational complexity theoryfind papers →
- PSPACE and NP-completenessfind papers →
Abstract
More Like ThisWe prove that deciding solvability of Puzznic, a falling-block puzzle game originally developed by Taito, is PSPACE-complete. To show hardness we construct a self-closing door gadget using Puzznic's game mechanics. For membership, we show that the configuration space is exponentially bounded and apply Savitch's theorem. We also improve an existing NP-completeness proof for a simpler version of the game known as Cubic, showing that this game is NP-complete even when restricted to only two kinds of blocks.