Beam Search
What is a disadvantage of beam search?
In a beam search algorithm with a beam width of 3, how many paths will be explored at each iteration?
In stochastic beam search, what does the term stochastic refer to?
How does local beam search handle ties when selecting the top-k states?
What happens if the beam width is too large relative to the size of the search space?
How does the choice of beam width impact the trade-off between exploration and exploitation in beam search?