APPLICATION OF SUPERVISED LEARNING
ARTIFICIAL INTELLIGENCE
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Which search method will expand the node that is closest to the goal?
|
|
Best-first search
|
|
|
A* search
|
|
|
Greedy best-first search
|
|
|
None of the mentioned
|
Explanation:
Detailed explanation-1: -Greedy best-first search expands the node that appears to be closest to goal.
Detailed explanation-2: -As what we said earlier, the greedy best-first search algorithm tries to explore the node that is closest to the goal. This algorithm evaluates nodes by using the heuristic function h(n), that is, the evaluation function is equal to the heuristic function, f(n) = h(n).
Detailed explanation-3: -So in summary, both Greedy BFS and A* are the Best first searches but Greedy BFS is neither complete nor optimal whereas A* is both complete and optimal. However, A* uses more memory than Greedy BFS, but it guarantees that the path found is optimal.
There is 1 question to complete.