Heuristics

An admissible heuristic is a function used in search algorithms that never overestimates the cost of reaching a goal.

A consistent heuristic ensures that the estimated cost to reach a goal never exceeds the actual cost from any point.

Informed search employs knowledge about the problem to find solutions more efficiently than uninformed methods.