Beam stack search

Beam stack search[1] is a search algorithm that combines chronological backtracking (that is, depth-first search) with beam search and is similar to depth-first beam search.[2] Both search algorithms are anytime algorithms 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 stack search 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 search using limited discrepancy backtracking[2] (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 beam stack search and depth-first beam search.

gollark: That's more physics.
gollark: What is your pH, nobody?
gollark: Now, if *Factorio* has taught me anything, you don't even need to go underground, just hit some big green patches with a pickaxe.
gollark: Well, if MInecraft has taught me anything, you can find uranium ore at about y=11 and then smelt it with some coal in a furnace made from 8 cubic metres of stone.
gollark: Why follow those rules? Just make nukes and threaten anyone who complains with nuclear annihilation.

References
  1. Zhou, Rong; Hansen, Eric (2005). "Beam-Stack Search: Integrating Backtracking with Beam Search". CiteSeerX 10.1.1.71.4147. Cite journal requires |journal= (help)
  2. Furcy, David. Koenig, Sven. "Limited Discrepancy Beam Search". 2005. "Archived copy" (PDF). Retrieved 2007-12-22.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.