The Problem: Navigate from the green start to the
red goal on a 2-D grid of passable cells and impassable
walls. Each step costs 1 unit. The 14 algorithms below explore the
grid with different strategies β compare how each shapes the visited region, path quality, and speed.
Left-click/drag to toggle walls.
Active Algorithm
β
none selected
Select an algorithm to see how it works.
Live Stats
β
Steps
β
Path Len
β
Visited
β
Result
Legend
Start
Goal
Wall
Visited (fwd)
Visited (bwd)
Frontier
Path found
RRT nodes
D* replan
Ready
Uninformed
Informed / Heuristic
Memory-Bounded / Iterative
Probabilistic / Sampling
2.5(1 = optimal A*, 5 = very fast/suboptimal)
β‘ D* Lite active β draw new walls on the grid and watch it replan!
Tip: Left-click / drag canvas to toggle walls Β· Reset generates a new random maze