Beam search is a heuristic search algorithm that explores a graph by expanding the most promising node within a limited set of candidates. It is a modification of best-first search built to reduce its memory requirements: where best-first search orders all partial solutions according to a heuristic, beam search keeps only a predetermined number of the best partial solutions as candidates at each step, making it a greedy algorithm.
Facts
Classification
Design Technique Sources
1. Beam Search (Wikipedia)
https://en.wikipedia.org/wiki/Beam_searchQuote, https://en.wikipedia.org/wiki/Beam_search
It is thus a greedy algorithm.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.