A best first search is an algorithm that explores a graph or tree by expanding the most promising node according to a specific rule or heuristic function.

Example

Common examples of best first search algorithms include: