Best-first-search
Mix of depth-first/breadth first strategies
Intuition: follow single path at a time but switch paths whenever some competing path looks better
Algorithm: Given set S of states, select most promising state using heuristic function, expand chosen state, add new states to S, repeat.
Beam search: keep only n most promising states in S.