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). A key component of these algorithms is a heuristic function denoted h(n) = estimated cost of the cheapest path from node n to a goal node. If n is a goal node, then h(n) = 0.
Special cases:
- Greedy best-first search
- A* search