Maze Solving Algorithms: Difference between revisions
From wikiluntti
| (4 intermediate revisions by the same user not shown) | |||
| Line 4: | Line 4: | ||
# Hand-on-Wall rule (works If the maze is simply connected) | # Hand-on-Wall rule (works If the maze is simply connected) | ||
# Pledge algorithm | # Pledge algorithm | ||
# Trémaux's 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 (BFS) | |||
## the A* algorithm | |||
## Depth-First Search (DFS). | |||
## Dijkstra’s Algorithm | |||
# Multi-agent maze-solving | |||
== Dead-end filling == | |||
== == | == == | ||
Latest revision as of 15:52, 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 (BFS)
- the A* algorithm
- Depth-First Search (DFS).
- Dijkstra’s Algorithm
- Multi-agent maze-solving
