Best-first search is a type of search algorithm used in graph traversal and pathfinding. It explores a graph by expanding the most promising node according to a specified rule or heuristic. The main goal of Best-first search is to find the most effective path to the goal state with minimal cost, time, or distance, depending on how the heuristic is defined.
Articles by others on the same topic
Maintain a frontier of partial states in a priority queue and expand the state with the best current priority. Correctness of a particular stopping rule depends on what the priority bounds. If every descendant has smaller priority than its ancestor, the frontier maximum also bounds the priority of every unseen descendant.