Which search technique is complete and optimal when h(n) is consistent?
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: C. A* search
Explanation
A* with a consistent (hence admissible) heuristic is complete and optimal (graph search).More Artificial Intelligence (AI) questions
- The process of capturing an inference process as a single inference rule is called:
- Fuzzy logic is a form of ____
- The 4Ws problem canvas helps in identifying the key elements related to the problem. The 4Ws problem canvas is a part of ____
- Consider the following features of neural networks: A. It is essentially a machine-learning algorithm. B. It is useful for problems where t…
- Consider the following drawbacks of the rule-based approach: A. The learning is static. B. Changes made to the original data are not consid…
- Match List I with List II (I. Unsupervised learning, II. Supervised learning): A. Regression, B. KNN, C. Clustering, D. Decision Tree