Maze Solving Algorithms

From wikiluntti
Revision as of 15:52, 5 April 2026 by Mol (talk | contribs) (→‎Introduction)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Introduction

  1. Random movement algorithm
  2. Hand-on-Wall rule (works If the maze is simply connected)
  3. Pledge algorithm
  4. Trémaux's algorithm. A junction may have multiple entrances, and a passage has an entrance at both ends. Dead-end.
  5. Dead-end filling
  6. Maze-routing algorithm
  7. Shortest path algorithm
    1. breadth-first search (BFS)
    2. the A* algorithm
    3. Depth-First Search (DFS).
    4. Dijkstra’s Algorithm
  8. Multi-agent maze-solving

Dead-end filling