B* search algorithm

In computer science, B* (pronounced "B star") is a best-first, graph search algorithm that finds the least-cost path from a given initial node to one goal node (out of one or more possible goals). First published by Hans Berliner in 1979, it is related to the A-star search algorithm. It stores intervals for nodes of the tree as opposed to single point-valued estimates. Then, leaf nodes of the tree can be searched until one of the top level nodes has an interval which is clearly "best."

References

• Berliner, Hans (1979). "The B* Tree Search Algorithm. A Best-First Proof Procedure.". Artificial Intelligence (journal) 12 (1): pp. 23 - 40. 
• Russell, S. J.; Norvig, P. (2003). Artificial Intelligence: A Modern Approach, pp. 188. ISBN 0-13-790395-2. 
• page on Berliner's paper provided by the Defense Technical Information Center

 This computer science-related article is a stub. You can help Wikipedia by expanding it.