The B* Tree Search Algorithm: A Best-First Proof Proceduret

In this paper we present a new algorithm for searching trees. The algorithm, which we have named For this reason, the search is usually limited in some way (e.g., number of nodes B*, finds a proof that an arc at the root of a search tree is better than any other. It does this by to be expanded, or maximum depth to which it may go).