https://www.youtube.com/watch?v=ySN5Wnu88nE&pp=ygUTYSogc2VhcmNoIGFsZ29yaXRobQ==

https://www.youtube.com/watch?v=6TsL96NAZCo&pp=ygUTYSogc2VhcmNoIGFsZ29yaXRobQ==

https://en.wikipedia.org/wiki/A*_search_algorithm

https://www.geeksforgeeks.org/a-search-algorithm/

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

https://www.youtube.com/watch?v=6TsL96NAZCo

We can understand the reason for A* better when we focus from the point of Dijkstra’s Algorithm and what it lacks. Thus from there we can build up on how A* provides an heuristic on the same.

Problem Statement: Dijkstra’s will follow the path that is currently the shortest without any inherent sense of the direction it is searching. The Dijkstra’s algorithm works efficiently when there is a uniform grid of sorts, where the weights of the graph are uniform and there is no cost associated to any of the edge.