A* search is an informed search algorithm used for path-finding and graph traversal It combines the advantages of both Dijkstra’s algorithm (in that it can find a shortest path) and Greedy Best-First-Search (in that it can use a heuristic to guide search)