Abstract
B* is a heuristic search method that can be applied to both adversary and non-adversary problems, but only when the search has an iterative character. It computes the best next step toward the solution on the basis of an evaluation function.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Reference
Berliner, H. The B* tree search algorithm: a best-first proof procedure. Artificial Intelligence 12:23–40. 1979.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bundy, A., Wallen, L. (1984). B* Algorithm. In: Bundy, A., Wallen, L. (eds) Catalogue of Artificial Intelligence Tools. Symbolic Computation. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-96868-6_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-96868-6_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13938-6
Online ISBN: 978-3-642-96868-6
eBook Packages: Springer Book Archive