A* Pathfinding Algorithm Visualization

Interactive pathfinding with multiple heuristics. A* finds the shortest path between two points while avoiding obstacles. Used in games, robotics, and navigation systems!

Algorithm Controls

1.0
10ms

Maze Controls

Statistics

Path Length: 0
Nodes Explored: 0
Execution Time:
0ms
Heuristic: Manhattan

Pathfinding Grid

Click or drag to create walls โ€ข Drag Green (Start) or Red (Target) to move them

Legend

Start Point
Target Point
Wall/Obstacle
Explored Node
Final Path
Frontier Node