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
Q10: How many types of informed search method
Q11: Which function will select the lowest expansion
Q12: What is the heuristic function of greedy
Q13: Which search uses only the linear space
Q14: Which method is used to search better
Q16: Which is used to improve the performance
Q17: Which search method will expand the node
Q18: Which data structure is used to give
Q19: Which is used to extract solution directly
Q20: What are present in the planning graph?
A)sequence
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents