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. It was first published by Hans Berliner in 1979 and is related to the A* search algorithm.
Connections
Credited To
In Field
Invented By
Sources
B* (Wikipedia)
Credited To: Hans Berliner, Lead section
First published by Hans Berliner in 1979
Invented By: Hans Berliner, Lead section
First published by Hans Berliner in 1979
In Field: Algorithms and Complexity Theory, Lead sentence
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).
In Group: Heuristic Graph Search and Pathfinding Algorithms, Lead section
best-first graph search algorithm
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.