Heuristics and Problem Solving
Definition
A heuristic is an estimate or rule used to guide search toward promising states without exhaustively checking every alternative.
What is a heuristic?
A heuristic is a rule or numerical estimate used to guide problem solving toward promising choices. In search algorithms, a heuristic function often estimates how far a current state is from a goal.
Why heuristics help
Many problem spaces are too large to explore exhaustively. A good heuristic reduces wasted exploration by ranking states that appear more useful. In A* search, for example, the heuristic is combined with the cost already accumulated.
What heuristics cannot guarantee
A heuristic is guidance, not proof. Some heuristics are designed with properties that preserve optimality; others trade accuracy for speed. The general lesson remains important in AI: reducing a huge search space often requires useful approximations rather than brute force.
Related terms, defined
Reference guide and primary sources
Wikipedia is used here as a terminology and history reference guide. Current model versions, institutional statistics and product-specific claims are also linked to first-party or institutional sources because those details can change faster than encyclopedia articles.