Pathfinding = going from the start cell to the goal cell on the grid, avoiding walls. The algorithms differ in how they pick the next cell (queue / stack / priority queue) → they differ in how many cells must be visited and whether the path is shortest.
—
Pick a "Scenario" to change the algorithm (BFS · DFS · Dijkstra · A* · maze · compare) · 🔀 new maze · CLICK/drag on the grid to add–remove walls · click a concept for details
Your browser has canvas disabled.
Cells visited & frontier size over timecells visitedfrontier