Beam search
Heuristic search algorithm / From Wikipedia, the free encyclopedia
In computer science, beam search is a heuristic search algorithm that explores a graph by expanding the most promising node in a limited set. Beam search is a modification of best-first search that reduces its memory requirements. Best-first search is a graph search which orders all partial solutions (states) according to some heuristic. But in beam search, only a predetermined number of best partial solutions are kept as candidates.[1] It is thus a greedy algorithm.
![Thumb image](http://upload.wikimedia.org/wikipedia/commons/thumb/2/23/Beam_search.gif/320px-Beam_search.gif)