Which among the following statement(s) is(are) FALSE?
A. Greedy best‐first search is not optimal but is often efficient. A*
B. is complete and optimal provided h(n) is admissible or consistent.
C. Recursive best‐first search is efficient in terms of time complexity but poor in terms of space complexity. h(n) = 0
D. is an admissible heuristic for the 8‐ puzzle.
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: C. C only
Explanation
Recursive best-first search is efficient in space (linear) but may regenerate nodes, so it is poor in time; C states the opposite and is false. A, B and D are true (h = 0 never overestimates).
More Artificial Intelligence (AI) questions
- Consider the sentence: There is a country that borders both India and Pakistan. Which expression is correct, where Country(x) means x is a…
- The marginal probability of cavity P(cavity) is __________.
- The probability of a cavity, given evidence of a toothache, P(cavity | toothache) is __________.
- The probability of a toothache, given evidence of a cavity, P(toothache | cavity) is __________.
- P(cavity ∨ toothache) is __________.
- The probability for Cavity, given that either Toothache or Catch is true, P(Cavity | toothache ∨ catch) is _______.