Beam Search

A heuristic graph/tree search algorithm that explores the search space by keeping only a fixed number (beam width) of the highest-ranked partial solutions at each depth, pruning lower-ranked alternatives to limit computational cost while sacrificing completeness or optimality depending on beam size and ranking heuristic.