"how numbers are stored and used in computers"
The A* algorithm is a is a variant of Dijkstra's algorithm that uses a heuristic function to estimate the cost of the shortest path. The heuristic function is a function that estimates the cost of the shortest path from the current node to the goal node.