Match List I with List II. List I: A. Greedy best-first search, B. A*, C. Recursive best-first search, D. SMA*. List II: I. Space complexity is O(d), where d is the depth of the deepest optimal solution, II. Incomplete even if the search space is finite, III. Optimal if the optimal solution is reachable; otherwise returns the best reachable solution, IV. Computation and space complexity are too high.

1. AA-II, B-IV, C-I, D-III
2. BA-II, B-III, C-I, D-IV
3. CA-III, B-II, C-IV, D-I
4. DA-III, B-IV, C-II, D-I

Pick an option to check yourself, or open the answer below.

Show answer & explanation

Correct answer: A. A-II, B-IV, C-I, D-III

Explanation

Greedy best-first can loop even in finite spaces; A* uses too much time and memory; RBFS needs only linear space; SMA* is optimal if the optimal solution fits in memory.