Best-First Search (Greedy Best-First)

Selects the next path expansion based on an evaluation function (often a heuristic), always expanding the path that appears best at the moment.