Best first search


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.
(1995-12-09)

Read Also:

  • Best fit

    best fit contemporary examples why do we want prices in health care? megan mcardle february 26, 2013 historical examples in the school-room john s. hart alice, or the mysteries, complete edward bulwer-lytton erasmus and the age of reformation johan huizinga the complete essays of c. d. warner charles dudley warner science in the kitchen. mrs. […]

  • Best of both worlds, the

    benefits from two seemingly opposed alternatives, as in jenny taught in the morning only and worked on her book afternoons, so she had the best of both worlds . charles kingsley used this idiom in westward ho! (1855): “make the best of both worlds.” also see make the best of it

  • Best part of something

    nearly all of something, the majority, as in the dentist was late; i waited for the best part of an hour. the adjective best here does not concern quality but quant-ty. [ first half of 1500s ] also see: better half, def. 1.

  • Bestrow

    bestrew.

  • Bestseller

    a book that is among those having the largest sales during a given period. any product that among those of its kind is selling particularly well at a given time: this car was a bestseller last year. contemporary examples aslan vs. beinart: a daily beast debate reza aslan, peter beinart january 31, 2009 what if […]


Disclaimer: Best first search definition / meaning should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional. All content on this website is for informational purposes only.