Best-first search

Best-first search is a search algorithm which explores a graph 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." [Pearl, J. "Heuristics: Intelligent Search Strategies for Computer Problem Solving". Addison-Wesley, 1984. p. 48.] This general sense of the term is used by many authors, including Russell & Norvig.Russell Norvig 2003. pp. 94 and 95 (note 3).]

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.

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.

A path-finding problem might use the algorithm in this form: 1. Start with OPEN containing just the initial state 2. Until a goal state is found or there is no node left on OPEN do: i. Pick the best node on OPEN ii. Generate its successors iii. For each successor do: a. If it has not been generated before: evaluate it, add it to OPEN and record its parent b. Otherwise: change the parent if this new path is better than previous one.

ee also

*Beam search
*A* search algorithm
*Dijkstra's algorithm

References

External links

*http://www.cee.hw.ac.uk/~alison/ai3notes/subsubsection2_6_2_3_2.html