What is the evaluation function in greedy approach?
A. Heuristic function
B. Path cost from start node to current node
C. Path cost from start node to current node + Heuristic cost
D. Average of Path cost from start node to current node and Heuristic cost
Answer:A
What is the evaluation function in greedy approach?
A. Heuristic function B. Path cost from start node to current node C. Path cost from start node to current node + Heuristic cost D. Average of Path cost from start node to current node and Heuristic cost
Explanation: Greedy best-first search3 tries to expand the node that is 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).