##  [Beam Search](/index.php/beam-search) 

  ##  [Beam Search](https://natural.quantumdictionary.io/beam-search-0) 

  

 [![Natural & Formal Sciences Dictionary](/sites/default/files/styles/large/public/2026-01/Natural%20%26%20Formal%20Sciences.png.webp?itok=2kCDRVQv)](/index.php/topic-specific-dictionaries/natural-formal-sciences)



**Natural & Formal Sciences Dictionary**

 







 

 

 

 



 

 

 

 

Definition

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.