Solving the KO labyrinth

DOI10.4169/MATH.MAG.88.1.27MaRDI QIDQ3454190zbMATH OpenOpenAlexFDO

Authors Alissa S. Crans, Robert J. Rovetti, Jessica Vega

Publication date 23 November 2015

Published in Mathematics Magazine (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4169/math.mag.88.1.27

zbMATH Keywords

Dijkstra's algorithmKO graphKO Labyrinthrandom walkshortest pathspherical puzzles

Mathematics Subject Classification ID

Recreational mathematics (00A08) Distance in graphs (05C12) Random walks on graphs (05C81) Applications of graph theory (05C90)

Recommendations

• scientific article; zbMATH DE number 3972189
• Un algoritmo estocástico para resolver laberintos
• The Complexity of Escaping Labyrinths and Enchanted Forests.
• scientific article; zbMATH DE number 194193
• On the traversal of labyrinths in n-dimensional space by automata

This page was built for publication: Solving the KO labyrinth

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