Beam stack search: Difference between revisions

Revision as of 03:22, 20 June 2008

Revision as of 14:40, 17 September 2008

Line 7:

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

In most respects, the [[Divide_and_conquer_algorithmdivide and conquer algorithm]] technique can be combined with beam-stack search in the same way as with beam search, creating an algorithm called divide-and-conquer beam-stack search.

==External links==