Changes

[[FILE:Moonlit Beauties by Luis Ricardo Falero.jpg|border|right|thumb|Moonlit Beauties <ref>[http://commons.wikimedia.org/wiki/File:Moonlit_Beauties_by_Luis_Ricardo_Falero.jpg Moonlit Beauties] by [[Arts#Falero|Luis Ricardo Falero]], [https://en.wikipedia.org/wiki/Oil_painting Oil on canvas], 19th century, [https://en.wikipedia.org/wiki/Wikimedia_Commons Wikimedia Commons]</ref> ]]

a [[Best-First|best-first]] search algorithm that finds the least-cost path from the [[Root|root node]] to any goal node out of one or more possible goals. B* was first published by [[Hans Berliner]] in [[Timeline#1977|1977]] <ref>[[Hans Berliner]] ('''1977'''). ''The B* Tree Search Procedure: Best-first Search Combined with Branch and Bound''. Computer Science Department. [[Carnegie Mellon University]]</ref>, it is related to the [https://en.wikipedia.org/wiki/A*_search_algorithm A* search algorithm].