best first search


best first search

(algorithm)A graph search algorithm which optimisesbreadth first search by ordering all current paths accordingto some heuristic. The heuristic attempts to predict howclose the end of a path is to a solution. Paths which arejudged to be closer to a solution are extended first.

See also beam search, hill climbing.