Heuristic Search
Updated 2026-08-15
INTRODUCTION
English translation pending.
CORE DEFINITION
Heuristic search is a central technique in artificial intelligence, formalized in algorithms such as A* and in the branch-and-bound methods of operations research. Its core proposition is that when exhaustive enumeration is infeasible, an estimate of how close a state is to the goal can order the exploration so that promising paths are examined first and resources are spent where they are most likely to pay. The key qualification is admissibility: if the estimate can exceed the true remaining cost, the search may return a path that is not optimal, so the quality of the heuristic bounds the quality of the result.
SCAFFOLDING EFFECT
Reduce cognitive load
- Use heuristic design: define a cheap estimate of the remaining distance to the goal. - Use ordering rule: expand the node with the best estimated total cost next. - Use admissibility check: confirm the estimate never exceeds the true remaining cost.
Anchor fast decisions
Uniform search spends the same effort everywhere, so most of the work goes into regions that cannot contain a solution. An estimate of remaining distance reorders the queue, so the frontier moves toward the goal and the wasted expansion falls. If the estimate never overstates the remaining cost, the first solution found is optimal, because any lower path would have had a lower estimate and been expanded earlier. When the estimate is optimistic in the other direction, the search becomes faster but loses that guarantee, which is the trade the designer chooses.
MINIMUM ACTION
In progress 0/1Practice this model in one real situation:
account_treeGenealogyexpand_more
menu_bookReferencesexpand_more
Source support: Explicit
- en.wikipedia.orghttps://en.wikipedia.org/wiki/Heuristic_(computer_scienceverified
PRIVATE NOTES · Only visible to you
SAVED Q&A
ENTRY Q&A · Private saving available
Ask with a clear boundary
thinkingmodels answers from published entry context only.
Your question is sent to thinkingmodels. The answer uses public entry context only.
RELATED MODELS