Generalized Pete's Pike is PSPACE-complete

DOI10.1016/J.TCS.2015.11.036zbMath1333.68150OpenAlexW2187699282MaRDI QIDQ899314

Bernd Meyer

Publication date: 28 December 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.11.036

zbMATH Keywords

PSPACE-completenesslogic puzzlesolitaire gamesUFO puzzle

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Games involving topology, set theory, or logic (91A44) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Unnamed Item ⋮ \textsc{Snowman} is \(\mathsf{PSPACE}\)-complete

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fun with algorithms. 6th international conference, FUN 2012, Venice, Italy, June 4--6, 2012. Proceedings
• Assembling molecules in ATOMIX is hard
• Relationships between nondeterministic and deterministic tape complexities
• Randolphs Robot Game is NP-hard!
• Computational Complexity of Two-Dimensional Platform Games
• Rush Hour is PSPACE-complete, or ``Why you should generously tip parking lot attendants

This page was built for publication: Generalized Pete's Pike is PSPACE-complete