In this algorithm, it holds k number of states at any given time. At the start, these states are generated randomly. The successors of these k states are computed with the help of objective function. If any of these successors is the maximum value of the objective function, then the algorithm stops.<\/p>\n
Otherwise the (initial k states and k number of successors of the states = 2k) states are placed in a pool. The pool is then sorted numerically. The highest k states are selected as new initial states. This process continues until a maximum value is reached.<\/p>\n
function BeamSearch( problem, k), returns a solution state.<\/p>\n
start with k randomly generated states
\nloop
\ngenerate all successors of all k states
\nif any of the states = solution, then return the state
\nelse select the k best successors
\nend<\/p>\n","protected":false},"excerpt":{"rendered":"
In this algorithm, it holds k number of states at any given time. At the start, these states are generated randomly. The successors of these …<\/p>\n","protected":false},"author":2,"featured_media":0,"menu_order":0,"template":"","meta":{"footnotes":""},"class_list":["post-3339","glossary","type-glossary","status-publish","hentry"],"yoast_head":"\n