The Complexity of Escaping Labyrinths and Enchanted Forests.

DOI10.4230/LIPICS.FUN.2018.30zbMATH Open1489.68112OpenAlexW2808831986MaRDI QIDQ3301022FDOQ3301022

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

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

zbMATH Keywords

computational complexitycombinatorial game theoryboard gamesLabyrinthEnchanted Forest

Mathematics Subject Classification ID

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

Cites Work

• Powers of tensors and fast matrix multiplication
• Title not available (Why is that?)
• Provably Difficult Combinatorial Games

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)