best first search

(redirected from Best-first search)
Also found in: Wikipedia.

best first search

(algorithm)
A graph search algorithm which optimises breadth first search by ordering all current paths according to some heuristic. The heuristic attempts to predict how close the end of a path is to a solution. Paths which are judged to be closer to a solution are extended first.

See also beam search, hill climbing.
References in periodicals archive ?
algorithm, local search algorithm and best-first search algorithm are all heuristic search algorithm with heuristic function.
Generalized best-first search strategies and the optimality of A*.
It was determined that the best-first search found a path the fastest, however, it was the only search that did not always find optimal paths.