KIDS QUIZ
ROBOTS AND ARTIFICIAL INTELLIGENCE
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
What is the heuristic function of greedy best-first search?
|
|
f(n) != h(n)
|
|
|
f(n) < h(n)
|
|
|
f(n) = h(n)
|
|
|
f(n) > h(n)
|
Explanation:
Detailed explanation-1: -Explanation: Greedy best-first search3 tries to expand the node that is closest to the goal, on the grounds that this is likely to lead to a solution quickly. Thus, it evaluates nodes by using just the heuristic function: f (n) = h(n). 11.
Detailed explanation-2: -Explanation: Heuristic function is a function that maps from problem state descriptions to measures of desirability.
Detailed explanation-3: -Greedy search is a best-first strategy where we try to minimize the estimated cost to reach the goal. Since we are greedy, we always expand the node that is estimated to be closest to the goal state.
There is 1 question to complete.