AALL10 · Chapter 10Programming & Applications🏛️ Past Licensure QuestionID: da4ed5f2

In artificial intelligence search algorithms, what evaluation function $f(n)$ is used by Greedy Best-First Search?

Multiple Choice Options

A
$f(n) = g(n) + h(n)$
B
$f(n) = g(n)$
C
$f(n) = h(n)$
✓ Correct Option
D
$f(n) = g(n) - h(n)$

Detailed Technical Solution & Explanation

Greedy Best-First Search expands the node that is estimated to be closest to the goal, evaluating nodes solely by the heuristic function: $f(n) = h(n)$ . (In contrast, $A^*$ uses $f(n) = g(n) + h(n)$ ).

Option Analysis:

•

Option A (= g(n) + h(n): Evaluation function of

A^*

search.

•

Option B (= g(n): Uniform-cost search (Dijkstra's algorithm).

•

Option C (= h(n): Correct. Greedy best-first search expands nodes based strictly on the heuristic estimate

h(n)

•

Option D (= g(n) - h(n): Invalid evaluation metric.

Reference: Mock Test 07NEC Licensure Syllabus

Want to practice this topic interactively?

Test your knowledge with timed mock exams, instant answer evaluation, and score tracking.

Practice Chapter 10 Now →

Loading view...