Greedy Best – First Search tries to expand the node, i.e. closest to the goal, on the grounds that this is likely to lead to a solution quickly. Thus, it evaluates nodes by using just the heuristic function:

F(n) = h(n).

Let us see how this works for route. Finding …