Next: Example Previous: Hill Climbing Issues

Beam Search

Keep n best alternatives (anywhere in the Q)

queueing-fn is sort-by-h and only keep best n nodes

n is the ``beam width'' - like a flashlight beam of that width. Useful if memory is limited

if n=1, Hill Climbing

if n=infinity, Best-First Search