APPLICATION OF SUPERVISED LEARNING
ARTIFICIAL INTELLIGENCE
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
f(n) > h(n)
|
|
|
f(n) != h(n)
|
|
|
f(n) < h(n)
|
|
|
f(n) = h(n)
|
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: -The best First Search algorithm in artificial intelligence is used for for finding the shortest path from a given starting node to a goal node in a graph. The algorithm works by expanding the nodes of the graph in order of increasing the distance from the starting node until the goal node is reached.
Detailed explanation-3: -Explanation: Heuristic function is a function that maps from problem state descriptions to measures of desirability.
Detailed explanation-4: -The generic best-first search algorithm selects a node for expansion according to an evaluation function. Greedy best-first search expands nodes with minimal h(n). It is not optimal, but is often efficient.