CMPSCI 250 Homework 10, Spring 2009
Due Thursday May 7, on paper, and before class.
The number of points for each exercise is indicated in parenthesis.
Section 9.6 (p. 655): Use Uniform Cost Search to find a shortest path from a
to z in the graph from problem 2. For each iteration, give the contents of
the open and closed lists, and the k values for all vertices. (10)
Section 12.1 (pp. 793ff): 4 (7), 14 (12), 16 (9), 18 (12), 20 (5)
Section 12.3 (pp. 814ff): 16 (5), 18 (5), 20 (5), 24 (5), 26 (5), 28 (5),
34 (8), 38 (7)
Last modified: Thu Apr 30 17:09:39 EDT 2009