Beam stack search: Difference between revisions

Content deleted Content added
FrescoBot (talk | contribs)
m Bot: links syntax
fix dead link
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. http://www.cse.msstate.edu/~hansen/papers/icaps05beam.pdf</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 ==