B* Algorithm

Alias: alpha/beta pruning
  • Alan Bundy
  • Lincoln Wallen
Part of the Symbolic Computation book series (SYMBOLIC)

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.

Keywords

Tate Karen 

Reference

  1. [Berliner 79]
    Berliner, H. The B* tree search algorithm: a best-first proof procedure. Artificial Intelligence 12:23–40. 1979.MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Alan Bundy
    • 1
  • Lincoln Wallen
  1. 1.Department of Artificial IntelligenceEdinburgh UniversityEdinburghScotland

Personalised recommendations