A* Algorithm

A* Algorithm Introduction

One of the biggest problems with Dijkstra’s algorithm is that it is that it has the potential to be inefficient when searching for the shortest path, because it just looks for the next shortest leg

Heuristic

Combined weighting (Heuristic  + cost)

Heuristics

There are a number of common heuristic methods that can be used when

Manhattan Method

Diagonal Distance

Euclidean Distance

Resources

Teacher Presentation

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

Further reading beyond the specification

Nine Distance measures in Data Science