BEAM SEARCH
\bˈiːm sˈɜːt͡ʃ], \bˈiːm sˈɜːtʃ], \b_ˈiː_m s_ˈɜː_tʃ]\
Sort: Oldest first
-
An optimisation of the best first search graphsearch algorithm where only a predetermined number of pathsare kept as candidates. The number of paths is the "width ofthe beam". If more paths than this are generated, the worstpaths are discarded. This reduces the space requirements ofbest first search.
By Denis Howe
