Beam search uses breadth-first search to build its search tree. At each level of the tree, it generates all successors of the states at the current level, sorts them in order of increasing heuristic values. However, it only stores a predetermined number of states at each level (called the beam width). The smaller the beam width, the more states are pruned. Therefore, with an infinite beam width, no states are pruned and beam search is identical to breadth-first search. The beam width bounds the memory required to perform the search, at the expense of risking completeness (possibility that it will not terminate) and optimality (possibility that it will not find the best solution). The reason for this risk is that the goal state could potentially be pruned.
It has also been used in an implementation of the game five in a row. A list of possible successors to win the game is built and categorized threats are evaluated. A criterion of this game is whether or not the computer needs to adjust its strategies depending on how many possibilities the person playing the computer has to win.
Wipo Publishes Patent of Huawei Technologies, Beijing University of Posts and Telecommunications, Pei Liu, Bin Li, Weixia Zou for "Wave Beam Search Processing Method, Device and System" (Chinese Inventors)
Nov 23, 2012; GENEVA, Nov. 23 -- Publication No. WO/2012/152167 was published on Nov. 15. Title of the invention: "WAVE BEAM SEARCH PROCESSING...
US Patent Issued to Microsoft on May 15 for "Fast Beam-Search Decoding for Phrasal Statistical Machine Translation" (Washington Inventor)
May 23, 2012; ALEXANDRIA, Va., May 21 -- United States Patent no. 8,180,624, issued on May 15, was assigned to Microsoft Corp. (Redmond, Wash...