Catalogue of Artificial Intelligence Techniques
Aliases: Best-First Search
Keywords: agenda, evaluation function
Author(s): Dave Plummer
A technique for State Space searching, with the state space represented as a graph. It uses domain-specific knowledge expressed as a numerical evaluation function which assigns a number to each node of the graph. At each stage of the search, heuristic search develops the tip node with the best numeric score. Tip nodes may be stored on an agenda in order of numeric score. See A* Algorithm, Alpha/Beta Pruning, B* Algorithm, Branch-and-bound Algorithms, and Minimax for examples of heuristic search.
- Korf, R.E., Search: A Survey of Recent Results, Exploring Artificial Intelligence (Survey talks from the National Conferences on Artificial Intelligence)
, ed.), Morgan Kaufmann, San Mateo, California, 1988, pp.197--237 (Chapter 6).