The A* (A-star) searh algorithm is a graph traversal and pathfinding algorithm used often due to its optimizations
It can be considered an extension of the famous Djikstra's Algorithm.
However, A* achieves better performance by using heuristics to guide the search
Euclidian distance was used as a heuristic in this project.