The hidden beauty of the A* algorithm

00:00 Intro 01:38 Change the lengths! 06:34 What is a good potential? 12:31 Implementation 16:20 Bonus Video of Tom Sláma: Some related stuff: -- One thing I did not mention is that Dijkstra’s algorithm is designed to solve the problem of finding the shortest path from the start node to all other nodes of the graph. It does this job very well, in almost linear time, so there is not much to improve there. It is the problem of finding the shortest path between two nodes where A* usually improves upon Dijkstra. -- Here is a link to another example of A* run from Sarajevo to east Italy. You can see how the algorithm quickly reaches the first city, Tirana, but then it gets stuck because of the Adriatic sea. So it searches along its coastline until it finds Italy. After that it confidently runs through Italy until it finds the destination. -- If your heuristic is no