AALL10 · Chapter 10Basic Electrical & Electronics🏛️ Past Licensure QuestionID: ace0a6ec
In artificial intelligence search algorithms, what is the evaluation function f(n) in A* search?
In artificial intelligence search algorithms, what is the evaluation function f(n) in A* search?
Multiple Choice Options
- A
Heuristic function
- B
Path cost from start node to current node
- C✓ Correct Option
Path cost from start node to current node + Heuristic cost
- D
Average of Path cost from start node to current node and Heuristic cost
Detailed Technical Solution & Explanation
In the A* search algorithm, the node evaluation function is , combining the exact accumulated path cost from the root with the estimated remaining distance to the goal .
Option Analysis:
•
Option A (Heuristic function): Incorrect. Greedy Best-First Search.
•
Option B (Path cost from start node to current ...): Incorrect. Dijkstra's Algorithm.
•
Option C (Path cost from start node to current ...): Correct. Defines the A* evaluation metric .
•
Option D (Average of Path cost from start node ...): Incorrect.
Reference: Mock Test 06NEC Licensure Syllabus