| Class | Description |
|---|---|
| AStarEvaluationFunction |
Artificial Intelligence A Modern Approach (3rd Edition): page 93.
The most widely known form of best-first search is called A* search (pronounced "A-star search"). |
| AStarSearch |
Artificial Intelligence A Modern Approach (3rd Edition): page 93.
The most widely known form of best-first search is called A* Search (pronounced "A-star search"). |
| BestFirstSearch |
Artificial Intelligence A Modern Approach (3rd Edition): page 92.
Best-first search is an instance of the general TREE-SEARCH or GRAPH-SEARCH algorithm in which a node is selected for expansion based on an evaluation function, f(n). |
| GreedyBestFirstEvaluationFunction |
Artificial Intelligence A Modern Approach (3rd Edition): page 92.
Greedy best-first search tries to expand the node that is closest to the goal, on the grounds that this is likely to lead to a solution quickly. |
| GreedyBestFirstSearch |
Artificial Intelligence A Modern Approach (3rd Edition): page 92.
Greedy best-first search tries to expand the node that is closest to the goal, on the grounds that this is likely to lead to a solution quickly. |
| HeuristicEvaluationFunction |
Super class for all evaluation functions which make use of heuristics.
|
| RecursiveBestFirstSearch |
Artificial Intelligence A Modern Approach (3rd Edition): Figure 3.26, page
99.
|