Question: In A * search, prove that if a heuristic function h ( n ) is consistent, it must be admissible. [ Hint: apply the definition
In A search, prove that if a heuristic function hn is consistent, it must be admissible.
Hint: apply the definition of consistent heuristic functions repeatedly along the optimal path from
node n to optimal goal node G
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
