Pathfinder Game
Interactive pathfinding visualizer
A* Search
A* uses both the actual distance from start and estimated distance to goal (heuristic) to find the optimal path efficiently.
Complexity
Time:
O(b^d)Space:
O(b^d)Properties
Guarantees shortest path
Uses heuristic
Advantages
- +Finds shortest path
- +Very efficient with good heuristic
- +Widely used in games and robotics
- +Optimal and complete
Disadvantages
- -Requires good heuristic function
- -Can use significant memory
- -Performance depends on heuristic quality
Statistics
Run an algorithm to see statistics