Maze Solving Algorithms: Difference between revisions
From wikiluntti
| Line 6: | Line 6: | ||
# Trémaux's algorithm. A junction may have multiple entrances, and a passage has an entrance at both ends. Dead-end. | # Trémaux's algorithm. A junction may have multiple entrances, and a passage has an entrance at both ends. Dead-end. | ||
# Dead-end filling | # Dead-end filling | ||
# Maze-routing algorithm | |||
== Dead-end filling == | |||
== == | == == | ||
Revision as of 15:41, 5 April 2026
Introduction
- Random movement algorithm
- Hand-on-Wall rule (works If the maze is simply connected)
- Pledge algorithm
- Trémaux's algorithm. A junction may have multiple entrances, and a passage has an entrance at both ends. Dead-end.
- Dead-end filling
- Maze-routing algorithm
