Beam stack search: Difference between revisions

Revision as of 05:20, 29 April 2007

Revision as of 05:20, 29 April 2007

Line 8:

The resulting search algorithm is an anytime algorithm that finds a good, sub-optimal solution quickly, like beam search, and then backtracks and continues to find improved solutions until convergence to an optimal solution.

In most respects, the divide-and-conquer technique can be combined with beam-stack search in the same way as with beam search, creating an algorithm that we call divide-andconquerand-conquer beam-stack search.

==External link==