HW1: total (for three questions) 10 points
HW2 (total: 34 points):
3.3 [P]: 4 points for part (a), 3 points for part (b), 3 points for part (c), 3 points for part (d), 3 points for part (e), 1 point for part (f), 2 points for part (g): 19 points total
3.4 [P]: 6 points for part (a), 5 points for the first part of (b), 4 points for the second part of (b) (monotonicity): 15 points total.
HW3: total: 22 points; 4.1: 14 points (2 per part); 4.3: 8 points (2 per part).
(to be filled in)
HW4 (10 points) Enter the crosswork problem of 4.3(a) and 4.1(c) [P] in the CSP applet at AISpace. Solve with the generalized arc consistency algorithm. Turn in a printout of the network after the GAC algorithm stops. (This will not be a unique solution.) (1 point per part removed if networks do not show the network *just* after the GAC algorithm stops.)
PR1 (exercises 1,4,6 ch.22 of Luger and Stubblefield's _AI Algorithms, Data Structures, and Idioms in Prolog, Lisp, and Java_, Addison-Welsey, 2009 ("Problem Spaces and Search" in Java): 10 points total (5 points for submission; 7 points for submission that appears to work under eclipse; 8 points for submission that compiles; 10 points for submission that compiles and runs; 1 extra point, up to 10 only for a good sample run or output).
PR2 (exercise 5.13 [P]): 10 points (4 for part (a); 2 for each of the other three parts) HW 6 (exercises 5.7 & 5.8[P]): 20 points, 10 per exercise.