What is the heuristic function of greedy best-first search? A)f(n) != h(n) B)f(n) h(n)

Name: What is the heuristic function of greedy best-first search? A)f(n) != h(n) B)f(n) h(n)
Brand: Quizplus
Rating: 4.7 (35 reviews)

Question

What is the heuristic function of greedy best-first search?
A)f(n) != h(n)
B)f(n) < h(n)
C)f(n) = h(n)
D)f(n) > h(n)

Quizplus · Accepted Answer

The heuristic function of greedy best-first search is defined as f(n) = h(n), where h(n) is the estimated cost from node n to the goal. This heuristic guides the search process towards the goal by prioritizing nodes that are believed to be closer to the goal.

What Is the Heuristic Function of Greedy Best-First Search