Question: Prove A* is admissible. The proof should show that: a. A* search will terminate. b. During its execution there is always a node on open
Prove A* is admissible. The proof should show that:
a. A* search will terminate.
b. During its execution there is always a node on open that lies on an optimal path to the goal.
c. If there is a path to a goal, A* will terminate by finding the optimal path.
Step by Step Solution
3.40 Rating (156 Votes )
There are 3 Steps involved in it
Heres a proof of A s admissibility addressing the points a b and c a Termination of A search Finite state space A operates on a finite graph of nodes ... View full answer
Get step-by-step solutions from verified subject matter experts
