The Complexity of Escaping Labyrinths and Enchanted Forests.

DOI10.4230/LIPICS.FUN.2018.30MaRDI QIDQ3301022zbMATH OpenOpenAlexFDO

Authors Florian D. Schwahn, Clemens Thielen

Publication date 11 August 2020

Full work available at URL https://dblp.uni-trier.de/db/conf/fun/fun2018.html#SchwahnT18

zbMATH Keywords

board gamescombinatorial game theorycomputational complexityEnchanted ForestLabyrinth

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Combinatorial games (91A46)

Recommendations

• Logical labyrinths
• LABYRINTH CHAOS
• scientific article; zbMATH DE number 3890405
• scientific article; zbMATH DE number 3972189
• Meanders, knots, labyrinths and mazes
• Navigating the MAZE

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Powers of tensors and fast matrix multiplication
• Provably Difficult Combinatorial Games

Cited in

(2)

• Navigating the MAZE
• Solving the KO labyrinth

Describes a project that uses

Uses Software

• WASP

This page was built for publication: The Complexity of Escaping Labyrinths and Enchanted Forests.

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