Heuristic Function

A heuristic function is a problem-specific rule or estimate that guides search, decision-making, or problem-solving by exploiting structural regularities in a domain without guaranteeing optimality. In algorithmic search — from A* search to greedy best-first algorithms — the heuristic estimates the cost to reach a goal from a given state, transforming exhaustive exploration into directed traversal. In human cognition, heuristics are the mental shortcuts that bounded rationality demands: the recognition heuristic, the take-the-best heuristic, and the anchoring heuristic all compress complex judgments into computationally manageable operations.

The formal study of heuristic functions in artificial intelligence asks two questions: is the heuristic admissible (does it ever overestimate true cost?), and is it informative (does it meaningfully reduce the search space?). These properties are not independent. A perfectly accurate heuristic collapses search to a straight line; a completely uninformative one reduces to brute force. The art of heuristic design lies in finding functions that are cheap to compute yet capture enough structure to make the search tractable. The same question arises in cognitive science: why do some human heuristics yield near-optimal results while others produce systematic biases? The answer, in both domains, is that heuristics are not general-purpose tools but ecological adaptations — they perform well in environments whose structure matches the heuristic's assumptions and fail in environments that violate them.