The Complexity of Snake

DOI10.4230/LIPIcs.FUN.2016.11zbMath1369.68235OpenAlexW2474076045MaRDI QIDQ5282809

Tim Ophelders, Marzio De Biasi

Publication date: 17 July 2017

Full work available at URL: https://doi.org/10.4230/lipics.fun.2016.11

zbMATH Keywords

Snakepuzzlesmotion planninggamesnondeterministic constraint logicPSPACE

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

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

This page was built for publication: The Complexity of Snake