How to generate perfect mazes?

DOI10.1016/J.INS.2021.03.022MaRDI QIDQ6092099zbMATH OpenOpenAlexFDO

Authors

Publication date 23 November 2023

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2021.03.022

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Vortex maze construction
• Un algoritmo estocástico para resolver laberintos
• Rook Jumping Maze Design Considerations
• A solution for the maze problem based on the rules of cellular automata
• Navigating the MAZE

Cites work

• A new modification of the variational iteration method
• scientific article; zbMATH DE number 1256746 (Why is no real title available?)
• On the shortest spanning subtree of a graph and the traveling salesman problem
• The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees

This page was built for publication: How to generate perfect mazes?

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