Search heuristic
Also: cost-to-go estimate
An estimate of remaining path cost used to guide a search.
An admissible heuristic never overestimates true remaining cost; consistency supports efficient A* graph search.
Example Manhattan distance guides four-neighbor grid search without exceeding shortest path length.
Common misconception A more aggressive heuristic can be faster but may sacrifice optimality guarantees.