What heuristic do you use when searching for a
route between two cities on a large road map?
Draw to four levels the search tree produced by
the best-fit algorithm of Figure 11.10 in finding
the route from Trent to Wildwood. Each node
in the search tree will be a city on the map.
Begin with a node for Trent. When expanding a
node, add only the cities that are directly connected
to the city being expanded. Record in
each node the straight-line distance to
Wildwood and use this as the heuristic value.
Does the best-fit algorithm have a defect in its
processing? If so, what correction is needed?