Define Greedy Best-First Search

Question

Greedy Best-First Search: It uses a heuristic that attempts to predict how close the end of a path is to the goal state, so that paths which are judged to be closer to the state are explored first.