Maze Generator with Pathfinding Algorithms
Generate Maze
Find Path
Clear Path
Pause Visualization
A* Search
Dijkstra
Greedy BFS
Breadth-First
Maze Size:
101x101
Visualization Speed:
Algorithm:
A* Search
Path Length:
0
Cells Visited:
0
Time Taken:
0 ms
A* Search:
Uses both the actual cost from the start (g-score) and the estimated cost to the goal (h-score) to find the shortest path efficiently. Guarantees the shortest path when using an admissible heuristic.