Chapter 9: separate solutions
Question 1
What is the default optimal path cost?
The route S,B,G costs 2+1=3 and the route S,A,G costs 1+4=5, so the optimal path cost is 3 via S,B,G.
Question 2
Which changed heuristic condition fails?
Admissibility: h(B)=10 exceeds true remaining cost 1; consistency also fails on B->G.
Question 3
What does h=0 produce?
Uniform-cost search on nonnegative edges: the queue orders by cost so far alone. On the transfer graph it still returns the optimal route source, middle, target at cost 4, not the direct cost 7, because a zero estimate is admissible.