Up Next
Go up to 2 Searching on a simple graph
Go forward to Solution to part (b)

Solution to part (a)

The following shows the nodes added to and removed from the queue:
Node f-value Order Removed
UBC 5 1
JB 6 2
KD 9 3
KB 10 4
MP 13
BBY 21
DT 11 5
SP 11 6
Note that the other three nodes (AP, RM and SRY) are never placed on the queue, and their f-value is not computed. The final path computed is:
UBC -> JB -> KB -> DT -> SP

Computational Intelligence online material, ©David Poole, Alan Mackworth and Randy Goebel, 1999

Up Next