Beam search
Heuristic search algorithm
Beam search
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 that 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. It is thus a greedy algorithm.
Read on Wikipedia · Image BogdanShevchenko, CC BY-SA 4.0
Open boosters, collect cards and trade them. Free to play.
Play for free