AI MCQ #227: Which search is complete and optimal when h(n) is consistent?

by

Q227. Which search is complete and optimal when h(n) is consistent?

  • a) Best-first search
  • b) Depth-first search
  • c) Both Best-first & Depth-first search
  • d) A* search

✅ Correct Answer: D) A* search

Explanation: No explanation provided.