Question

Which approach is to pretend that a pure divide and conquer algorithm will work?

(a) Goal independence

(b) Subgoal independence

(c) Both Goal & Subgoal independence

(d) None of the mentioned

I have been asked this question in my homework.

Query is from State Space Search in section Adversarial Search of Artificial Intelligence

Answer 1

Correct answer is (b) Subgoal independence

To explain: Subgoal independence approach is to pretend that a pure divide and conquer algorithm will work for admissible heuristics.