- h*(n) = cost of the shortest path between node n and
a goal node (usually not known).
- h(n) = estimated cost to get to a nearest goal node from n .
- g(n) = cost to get to node n from the start node via the
lowest-cost path found so far.