Next: Example Previous: Example

Hill Climbing (Greedy Search)

Hill Climbing is also guided by h, but it saves time and space by only keeping the single best state seen so far.

queueing-fn is sort-by-h and only keep best node

Best-First Search is tentative , Hill Climbing is irrevocable

Advantage: much faster, takes less memory
If good heuristic, then Hill Climbing will lead immediately to the goal

Disadvantage: if bad heuristic, may prune away all the goals
Gets stuck in the tree above