Maze Solving Algorithms: Difference between revisions
From wikiluntti
| Line 8: | Line 8: | ||
# Maze-routing algorithm | # Maze-routing algorithm | ||
# Shortest path algorithm | # Shortest path algorithm | ||
## breadth-first search | ## breadth-first search (BFS) | ||
## the A* algorithm | ## the A* algorithm | ||
## Depth-First Search (DFS). | |||
## Dijkstra’s Algorithm | |||
# Multi-agent maze-solving | # Multi-agent maze-solving | ||
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
