Best-First Search: Best-first search is a variant of BFS which improves it by exploring the most promising neighboring state chosen according to the result of the evaluation function for that state. Efficient selection of the current best candidate for exploration is typically implemented using a priority queue.
There are different ways to compute the evaluation function, and therefore there are different variants and refinements of best-first search. Some of those comprised are Greedy Best-First Search, A* Search, and Beam search.