Beam search


only a predetermined number of best partial solutions are kept as candidates
explores a graph by expanding the most promising node in a limited set
use [BFS](https://texonom.com/bfs-79717daa6c3d4a3b8918e643b7329d70) to build [Search Tree](https://texonom.com/search-tree-af6447e7263f4a2ba296b05a1d765adb) 
A beam search is most often used to maintain tractability in large systems with insufficient amount of memory to store the entire search tree



> [Beam search](https://en.wikipedia.org/wiki/Beam_search)





