'''Beam stack search'''<ref>{{cite documentweb|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 | citeseerx id={{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 }}</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.
