Best-first search
From Wikipedia, the free encyclopedia
| Graph search algorithms |
|---|
| 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 f(n) 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."[1] This general sense of the term is used by many authors, including Russell & Norvig.[2]
Other authors have used best-first search to refer specifically to a search with a heuristic that attempts to predict how close the end of a path is to a solution, so that paths which are judged to be closer to a solution are extended first. This specific type of search is called greedy best-first search by Russell & Norvig.[2]
Efficient selection of the current best candidate for extension is typically implemented using a priority queue.
Examples of best-first search algorithms include the A* search algorithm, and in turn, Dijkstra's algorithm (which can be considered a specialisation of A*). Best-first algorithms are often used for pathfinding in combinatorial search.
[edit] See also
[edit] References
- ^ Pearl, J. Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, 1984. p. 48.
- ^ a b Russell, S.J., & Norvig, P. Artificial Intelligence: A Modern Approach. 2nd edition. Pearson Education, Inc, 2003. pp. 94 and 95 (note 3).
