'''Beam Stackstack Searchsearch'''<ref>{{cite web|url=https://cdn.aaai.org/ICAPS/2005/ICAPS05-010.pdf | last1 = Zhou, | first1 = Rong. | last2 = Hansen, | first2 = Eric A. "| title = Beam-Stack Search: Integrating Backtracking with Beam Search".2005|id={{CiteSeerX|10. http://www1.cse1.msstate71.edu/~hansen/papers/icaps05beam.pdf4147}} | year = 2005 }}</ref> is a [[search algorithm]] that combines chronological [[backtracking]] (that is, [[depth-first search]]) with [[beam search]] and is similar to Depthdepth-Firstfirst Beambeam Searchsearch.<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 }}</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 ==
Beam Stackstack Searchsearch uses the beam stack as a [[data structure]] to integrate chronological backtracking with beam search and can be combined with the [[divide and conquer algorithm]] technique, resulting in divide-and-conquer beam-stack search.
== Alternatives ==
Beam Searchsearch Usingusing Limitedlimited Discrepancydiscrepancy Backtrackingbacktracking<ref name="furcy" /> (BULB) is a search algorithm that combines limited discrepancy search with beam search and thus performs non-chronological [[backtracking]], which often outperforms the chronological backtracking done by Beambeam Stackstack Searchsearch and Depthdepth-Firstfirst Beambeam Searchsearch.
