A heuristic estimates which states seem promising so search spends less effort. It can improve speed but may bias exploration or sacrifice optimality unless its properties are known.

Heuristics Guide Search Without Proving the Answer

A* ranks states by cost so far plus estimated remaining cost. An admissible heuristic preserves optimality; an inconsistent or biased estimate can change work and results.

A* Combines Known Cost With a Heuristic

Beam search keeps only a fixed number of promising partial solutions at each depth. It controls cost but can permanently discard the route to the best solution.

Beam Search Trades Coverage for Bounded Width

Breadth-first search expands all states at one depth before moving deeper. It finds a fewest-edge path in an unweighted graph but can consume substantial memory.

Breadth-First Search Finds Shallow Unweighted Paths

Depth-first search follows a branch until it stops, then backtracks. It uses modest memory and supports cycle and ordering analyses, but does not generally find shortest paths.

Depth-First Search Explores One Branch Deeply

In this situation—prioritizing tools likely to reduce uncertainty in a troubleshooting plan—which choice best applies “Heuristics Guide Search Without Proving the Answer”?

Learn Before

Related