Admissible Heuristic
Domain: Algorithms
π― Motivation
A heuristic that never overestimates the true cost. Required for A* to guarantee an optimal solution.
π Concrete Example
Straight-line distance is admissible for road distance: the real road can only be longer or equal, never shorter. A* with this heuristic guarantees the shortest path.
π Analogy
A delivery estimate that says βat least 30 minutes.β The real time might be 40, but it is never less. This underestimate ensures you do not miss the optimal route.