Artificial Intelligence MCQ
What is disadvantage of Greedy Best First Search?
A)
This algorithm is neither complete, nor optimal.
B)
may not terminate and go on infinitely on one path
C)
It can get stuck in loops. It is not optimal.
D)
There can be multiple long paths with the cost ≤ C*

Correct Answer : Option (C) :   It can get stuck in loops. It is not optimal.

Explanation : The disadvantage of Greedy Best First Search is that it can get stuck in loops. It is not optimal.