Admissible Heuristic

In shortest-path search, a heuristic function that never overestimates the true remaining cost, thereby guaranteeing the optimality of the search algorithm.