Explanation: Heuristic is an estimated cost. 9. Greedy search strategy chooses the node for expansion
A. Shallowest
B. Deepest
C. The one closest to the goal node
D. Minimum heuristic cost
Answer:A
Explanation: Heuristic is an estimated cost. 9. Greedy search strategy chooses the node for expansion
A. Shallowest B. Deepest C. The one closest to the goal node D. Minimum heuristic cost
Explanation: Sometimes minimum heuristics can be used, sometimes maximum heuristics function can be used. It depends upon the application on which the algorithm is applied. 10. In greedy approach evaluation function is