A Greedy Best First Search is like Uniform Cost Search but for it includes a heuristic function (which is the estimated cost of the cheapest path from node to the goal) as a component of its evaluation function .
A Greedy Best First Search is like Uniform Cost Search but for it includes a heuristic function (which is the estimated cost of the cheapest path from node to the goal) as a component of its evaluation function .