Question

5. An admissible heuristic is one that
(1 Point)
Always overestimates the cost to reach the goal
Checks the condition h(n) s cín, a, n') + h(n')
Checks the condition h(n) = c(n, a, n) + h(n)
Never overestimates the cost to reach the goal
x
6. Which algorithm is incomplete and non-optimal?
(1 Point)​

Answer 1

Answer:

First follow me then I will answer..