Best-first search is a class of search algorithms, which explores a graph by expanding the most promising node chosen according to a specified rule. Wikipedia