Vidyalelo
Computer Science · Q384

Artificial Intelligence

Engineering and GATE · Computer Science · question 384

Q384

Heuristic function h(n) is ________

A.
Lowest path cost
B.
Cheapest path from root to goal node
C.
Estimated cost of cheapest path from root to goal node
Answer
D.
Average path cost

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board