best first searchcomputing dictionary


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.

(01 Mar 1995)

Besnoitiidae, besnoitiosis, best, best effort < Prev | Next > Best Fit, Best, Franz, bestiality

Bookmark with: icon icon icon icon iconword visualiser Go and visit our forums Community Forums