KIDS QUIZ
ROBOTS AND ARTIFICIAL INTELLIGENCE
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Which search is complete and optimal when h(n) is consistent?
|
|
Best-first search
|
|
|
Depth-first search
|
|
|
Both Best-first & Depth-first search
|
|
|
A* search
|
Explanation:
Detailed explanation-1: -Theorem: If h(n) is consistent, A * using GRAPH-SEARCH is optimal.
Detailed explanation-2: -A* algorithm works based on heuristic methods, and this helps achieve optimality. A* is a different form of the best-first algorithm. Optimality empowers an algorithm to find the best possible solution to a problem.
Detailed explanation-3: -An algorithm of Heuristic Search in state graphs is called complete if and only if it is. guaranteed that it terminates finding a path from the start node (s) to the set of goal nodes. when such a path exists.
There is 1 question to complete.