admissible heuristic

Also known as admissible heuristics

heuristic that never overestimates the cost of reaching the goal, i.e. the cost it estimates to reach the goal is not higher than the lowest possible cost from the current point in the path