ACtE09 · Chapter 9AI & Neural Networks🏛️ Past Licensure QuestionID: 8bd93c87

Which search method expands the node estimated closest to the goal?

Multiple Choice Options

A
Breadth-First Search (BFS)
B
Depth-First Search (DFS)
C
Greedy Best-First Search
✓ Correct Option
D
A* Search

Detailed Technical Solution & Explanation

Greedy Best-First Search evaluates nodes using solely the heuristic function: $f(n) = h(n)$ , expanding the node that is estimated to be closest to the goal state.

Option Analysis:

•

Option A (Breadth-First Search (BFS)): Expands shallowest node (blind search).

•

Option B (Depth-First Search (DFS)): Expands deepest node (blind search).

•

Option C (Greedy Best-First Search): Correct. Evaluates nodes solely by

h(n)

(estimated closeness to goal).

•

Option D (A* Search): Expands node minimizing

f(n) = g(n) + h(n)

(estimated total path cost).

Reference: Demo2 · Set 1NEC Licensure Syllabus

Want to practice this topic interactively?

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

Practice Chapter 9 Now →

Loading view...