(a) For the map shown below, find the shortest path that starts at city A, visits each of the other cities only once, and then returns to A.

(b) Find the path from start to finish, which passes once through all the nodes lettered a through u:

First solve the problems that are given. Next, make a list of the subproblems you considered while solving them. Discuss how a computer might be programmed to solve each of the given problems, and how each of the problems might be represented to the computer. If you find a state-space representation for a problem, estimate the size of the state space and try to identify heuristics and algorithms the machine could use to search it. If computer time is available to you, choose a problem and try to implement a computer program that can solve it.

Transcribed Image Text:

(A) B TS 10 13 9 D 6 (E)