Pathfinding & Maze Lab
A*, Dijkstra, BFS, DFS • Recursive Division & DFS Mazes • Weights • 4/8-Neighborhood
What is this?

An interactive lab for pathfinding and maze generation. Compare A*, Dijkstra, BFS, and DFS on a grid with walls and weighted terrain. Uniqueness: generator‑driven step‑through animations, weighted costs (1–9), 4/8‑neighborhood, zero dependencies.

Real‑world analogues: robotics & AGV routing, games AI, maps/logistics routing, evacuation planning. How to use: pick an algorithm, draw walls/weights or generate a maze, then press Space or click Run. Use Step to advance one expansion at a time. Move start/end with the Drag tool.

Local time:
Location: (requesting…)
Start End Frontier Visited Path Wall Weight