Beam stack search: Difference between revisions

Revision as of 19:18, 5 November 2010

Revision as of 19:00, 24 December 2010

Line 1:

'''Beam Stack Search'''<ref>Zhou, Rong. Hansen, Eric. "[http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.71.4147&rep=rep1&type=pdf Beam-Stack Search: Integrating Backtracking with Beam Search]". 2005. </ref> is a [[search algorithm]] that combines chronological [[backtracking]] (that is, [[depth-first search]]) with [[beam search]] and is similar to Depth-First Beam Search<ref name="furcy">Furcy, David. Koenig, Sven. "Limited Discrepancy Beam Search". 2005. http://www.ijcai.org/papers/0596.pdf</ref>. Both search algorithms are [[anytime algorithm]]s that find good but likely sub-optimal solutions quickly, like beam search, then backtrack and continue to find improved solutions until convergence to an optimal solution.

== Implementation ==

Line 12:

{{reflist}}

{{DEFAULTSORT:Beam Stack Search}}

[[Category:Search algorithms]]

{{algorithm-stub}}