best first search


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.

Last updated: 1995-12-09

Nearby terms:

Berzerkleybespokebest effortbest first searchbest fitBETAbeta

Try this search on Wikipedia, Wiktionary, Google, OneLook.