Maze Solving Algorithms: Difference between revisions
From wikiluntti
| Line 7: | Line 7: | ||
# Dead-end filling | # Dead-end filling | ||
# Maze-routing algorithm | # Maze-routing algorithm | ||
# Shortest path algorithm | |||
## breadth-first search | |||
## the A* algorithm | |||
# Multi-agent maze-solving | |||
== Dead-end filling == | == Dead-end filling == | ||
Revision as of 15:43, 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
- Shortest path algorithm
- breadth-first search
- the A* algorithm
- Multi-agent maze-solving
