The Complexity of Snake

DOI10.4230/LIPICS.FUN.2016.11MaRDI QIDQ5282809zbMATH OpenOpenAlexFDO

Authors Marzio De Biasi, Tim Ophelders

Publication date 17 July 2017

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

zbMATH Keywords

gamesmotion planningnondeterministic constraint logicPSPACEpuzzlesSnake

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1498834
• Snakes: from graceful to harmonious
• scientific article; zbMATH DE number 5250978
• The Complexity of Complexity
• Rational snakes
• scientific article; zbMATH DE number 1472114
• scientific article; zbMATH DE number 21365
• scientific article; zbMATH DE number 2061441
• Snakes in Movement
• On the snake in the box problem

Cited in

(7)

• The complexity of Snake and undirected NCL variants
• scientific article; zbMATH DE number 6701944 (Why is no real title available?)
• scientific article; zbMATH DE number 5315132 (Why is no real title available?)
• A world without pythons would be so simple
• The parameterized complexity of motion planning for snake-like robots
• \textsc{Snowman} is \(\mathsf{PSPACE}\)-complete
• Building a better Mouse Maze

This page was built for publication: The Complexity of Snake

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5282809)