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 any goal node (out of one or more possible goals). First published by Hans Berliner in 1979, it is related to the A* search algorithm.
~6 min read
Article
13 sectionsContents
- Summary
- Details
- Interval evaluations rather than estimates
- Backup process
- Termination of search
- Expansion
- Strategy selection
- Strategy selection at non-root nodes
- Robustness
- Extension to two-player games
- Applications
- See also
- References
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 any goal node (out of one or more possible goals). First published by Hans Berliner in 1979, it is related to the A* search algorithm.
==Summary== The algorithm 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."