Introduction to the A* Algorithm

The post describes the A* algorithm as a combination of two techniques: Dijkstra's algorithm, which explores the graph in a breadth-first search manner, and a heuristic function, which estimates the distance between each node and the goal node. The post provides a step-by-step breakdown of the algorithm, explaining how it works and how it is implemented.

https://www.redblobgames.com/pathfinding/a-star/introduction.html

#pathfinding #astar