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.

< Previous Terms	Terms Containing best first search	Next Terms >
Bertrand Meyer Bertrand Russell Berzerkeley Berzerkley best effort	beam search breadth first search hill climbing	Best Fit BETA beta beta abstraction beta conversion