In artificial intelligence search algorithms, what is the best-case time complexity of Best-First Search with a perfect heuristic that directs search directly along the optimal path to depth ?
In artificial intelligence search algorithms, what is the best-case time complexity of Best-First Search with a perfect heuristic that directs search directly along the optimal path to depth ?
Multiple Choice Options
- A✓ Correct Option
- B
- C
- D
Detailed Technical Solution & Explanation
With an ideal heuristic that perfectly guides search toward the goal, at each of the levels along the path, the search only expands the best node, but must generate all branch successors at each step. Thus, it examines at most nodes, giving time complexity.
Option Analysis:
•
Option A (O(b m)): Correct. Generating children along depth with a perfect heuristic.
•
Option B (O(b^m)): Worst-case exponential complexity when the heuristic provides no guidance.
•
Option C (O(m)): Ignores the branching factor required to generate successor nodes.
•
Option D (O(1)): Impossible since depth must be traversed.
Reference: Mock Test 03View Chapter 10 Official Syllabus Blueprint →