An optimisation of the best first search graph search algorithm where only a predetermined number of paths are kept as candidates. The number of paths is the "width of the beam". If more paths than this are generated, the worst paths are discarded. This reduces the space requirements of best first search.

In addition suitable contents:
[ = ] [ al ] [ algorithm ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ b ] [ be ] [ beam ] [ best first search ] [ ca ] [ card ] [ ch ] [ date ] [ de ] [ disc ] [ du ] [ ed ] [ edu ] [ er ] [ era ] [ es ] [ et ] [ fi ] [ file ] [ ge ] [ gen ] [ generate ] [ gr ] [ graph ] [ h ] [ hm ] [ hr ] [ hs ] [ id ] [ il ] [ in ] [ io ] [ ir ] [ is ] [ it ] [ ke ] [ Lex ] [ ly ] [ mo ] [ mod ] [ module ] [ na ] [ ne ] [ nl ] [ nu ] [ op ] [ pa ] [ path ] [ ph ] [ pr ] [ pt ] [ query ] [ rc ] [ re ] [ requirements ] [ sa ] [ sc ] [ se ] [ space ] [ st ] [ T ] [ th ] [ um ]