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) | ||||
Search Dictionary:
Best first search definition was found in categories: Encyclopedia(1)
Best first search Definition from Encyclopedia Dictionaries & Glossaries
| Wikipedia English - The Free Encyclopedia |
Best-first search
Best-first search is a search algorithm which optimizes breadth-first search by expanding the most promising node chosen according to some rule.
Judea Pearl described best-first search as estimating the promise of node n by a "heuristic evaluation function 
which, in general, may depend on the description of n, the description of the goal, the information gathered by the search up to that point, and most important, on any extra knowledge about the problem domain." This general sense of the term is used by many authors, including Russell & Norvig.
| See more at Wikipedia.org... |