A* Pathfinding
Controls:
Distance: 0 Cells
Legend:
Open Set
Closed Set
Path
A* is a smart and efficient algorithm used to find the shortest path from one point to another in a maze or graph. Imagine you're exploring a maze, and you want to reach a specific destination. A* helps you figure out the best way to get there by considering both the distance you've already traveled and an estimate of how much more distance you have to cover.
For nerds (LIKE ME) A* is a slight modification to Dijkstra's Algorithm that uses heuristics to cause directional search to avoid searching in redundant directions.
Manhattan distance measures the distance between two points as the sum of the absolute differences in their coordinates, while Euclidean distance calculates it as the straight-line distance between the points.