Beam stack search: Difference between revisions

Revision as of 14:35, 10 November 2016

Revision as of 11:02, 28 September 2018

Line 1:

'''Beam Stack Search'''<ref>{{cite paper | last1 = Zhou | first1 = Rong | last2 = Hansen | first2 = Eric | title = Beam-Stack Search: Integrating Backtracking with Beam Search | citeseerx = 10.1.1.71.4147 | year = 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. {{cite web|url=http://www.ijcai.org/papers/0596.pdf |title=Archived copy |accessdate=2007-12-22 |deadurl=yes |archiveurl=https://web.archive.org/web/20080516202406/http://www.ijcai.org/papers/0596.pdf |archivedate=2008-05-16 |df= }}</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 ==