best first search

Computing Dictionary

best first search definition

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.
The Free On-line Dictionary of Computing, © Denis Howe 2010
Cite This Source
Previous Definition: best evidence rule
Next Definition: best fit
Words Near: best first search
More from
Synonyms and Antonyms for best first search
More from
Search for articles containing best first search Word FAQs presents 366 FAQs, incorporating some of the frequently asked questions from the past with newer queries.

Copyright © 2014, LLC. All rights reserved.
  • Please Login or Sign Up to use the Recent Searches feature