B*

In computer science, B* (pronounced "B star") is a best-firstgraph 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.