A heuristic h₁ is more informed than another heuristic h₂ if for all states s, h₁(s) ≥ h₂(s).

The more informed the heuristic, the fewer vertices will be expanded.

If a heuristic is more informed without overestimating, then it is more efficient as well as optimal.