'''Beam Stack Search'''<ref>{{cite paper | last1 = Zhou, | first1 = Rong. | last2 = Hansen, | first2 = Eric."[http://citeseerx.ist.psu.edu/viewdoc/download?doi| title =10.1.1.71.4147&rep=rep1&type=pdf Beam-Stack Search: Integrating Backtracking with Beam Search]" | 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. 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.
