Recommendations
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
- Computational complexity of generalized Push Fight
- \textsc{Snowman} is \(\mathsf{PSPACE}\)-complete
- Computational complexity of two-dimensional platform games
- \textsc{Pull} and \textsc{PushPull} are PSPACE-complete
Cites work
- scientific article; zbMATH DE number 2002586 (Why is no real title available?)
- scientific article; zbMATH DE number 1882054 (Why is no real title available?)
- Assembling molecules in ATOMIX is hard
- Computational complexity of two-dimensional platform games
- Fun with algorithms. 6th international conference, FUN 2012, Venice, Italy, June 4--6, 2012. Proceedings
- Games, puzzles, and computation
- Randolphs Robot Game is NP-hard!
- Relationships between nondeterministic and deterministic tape complexities
- Rush Hour is PSPACE-complete, or ``Why you should generously tip parking lot attendants
Cited in
(2)
This page was built for publication: Generalized Pete's Pike is PSPACE-complete
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q899314)