The A* algorithm modifies the best-fit algorithm in two significant ways. First, it record...

The A* algorithm modifies the best-fit algorithm in two significant ways. First, it records the actual cost to reach a state. In the case of a route on a map, the actual cost is the distance traveled. Second, when selecting a node to expand, it chooses the node whose sum of the actual cost plus heuristic value is the smallest. Draw the search tree of problem 1 that would result from these two modifications. Record in each node the distance traveled to the city, the heuristic value to reach the goal, and their sum. What is the found path from Dearborn to Wildwood?

Problem 1

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?