 Perfect heuristic

The exact minimum remaining path cost from a state to a goal state, with value $\infty$ when no goal is reachable. For nonnegative step costs, $h^{\ast }(g)=0$ at goals and $h^{\ast }(s)\le c(s,s^{\prime })+h^{\ast }(s^{\prime })$ on every transition. Thus a perfect heuristic is a consistent heuristic and an admissible heuristic. It measures remaining cost; a greedy best-first search decision using only this number can still take an excessively costly incoming edge.