This shows you the differences between two versions of the page.

lab7 [2017/02/18 15:31] franck |
lab7 [2017/02/18 15:32] (current) franck |
||
---|---|---|---|

Line 1: | Line 1: | ||

+ | ====== Lab 7 ====== | ||

+ | |||

The beam search strategy uses the breadth-first search strategy to build its state space. At each level of the search tree, it generates only a limited number of successors of the states at the current level. To simplify matters, we limit that number to two. In general, the beam search strategy would pick the two "best" successors. Again, to simplify matters, our beam search strategy will select the two "left-most" successors. Consider, for example, the following state space diagram. | The beam search strategy uses the breadth-first search strategy to build its state space. At each level of the search tree, it generates only a limited number of successors of the states at the current level. To simplify matters, we limit that number to two. In general, the beam search strategy would pick the two "best" successors. Again, to simplify matters, our beam search strategy will select the two "left-most" successors. Consider, for example, the following state space diagram. | ||

Last modified:

2017/02/18 15:32

2017/02/18 15:32