Multiple Choice
What is the heuristic function of greedy best-first search?
A) f(n) != h(n)
B) f(n) < h(n)
C) f(n) = h(n)
D) f(n) > h(n)
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q2: How the decision tree reaches its decision?<br>A)single
Q3: What is called inconsistent support?<br>A)if two literals
Q4: How many types of informed search method
Q5: What is meant by persistence actions?<br>A)allow a
Q6: Which is used to improve the performance
Q7: Which search is complete and optimal when
Q8: Which method is used to search better
Q9: End Nodes are represented by,<br>A)disks<br>B)squares<br>C)circles<br>D)triangles
Q10: Chance Nodes are represented by,<br>A)disks<br>B)squares<br>C)circles<br>D)triangles
Q11: When will further expansion is unnecessary for