Multiple Choice
Which search is complete and optimal when h(n) is consistent?
A) best-first search
B) depth-first search
C) both a & b
D) a* search
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
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
Q12: What are present in the planning graph?<br>A)sequence