Let's test your knowledge. Fill in the missing part by typing it in.

The A* algorithm combines the principles of both Dijkstra's algorithm and greedy best-first search. It evaluates paths based on the sum of two costs: the cost to reach the current node from the start node, and an estimated cost to reach the target node from the current node. The estimated cost is calculated using a __ function, which provides an estimate of the remaining distance to the target.