Points for each assignment.

• HW1: Total 20 points. Ex.1.1[P]: 10 points (1 point off for each missing reason; 1 point off for missing defn of "more intelligent"). Ex.1.3[P]: 10 points (5 points per part: 1 point off for missing references; 1 points off for missing part).
• HW2: Total 10 points. Incorrect order of closing of nodes: lose 3 points; incorrect g-values: lose 3 points.
• HW3 (total: 31 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), 1 point for the second part of (b) (monotonicity): 12 points total.
• HW4 (total: 12 points):
  4.1 parts a-d only: 12 points (3 per part)
• HW5 (total: 8 points):
  4.3: 8 points (2 per part);
• HW6 (total: 13 points):
  4.11 [P], with extensions described in the lecture log: 2 points for drawing the initial constraint network correctly; 4 points for part (a) (including constraint network and interaction network), 7 points for part (b) (including constraint network and interaction network): 13. points total
• HW7 (total: 14 points):
  5.3 and 5.4 (2 points per part).
• HW8 (Programming Assignment) (total: 10 points):
  Exercise 5.6.
• HW9 (total: 8 points): Exercise 5.9 [P].
• HWGrad (extra homework for graduate credit; total: 10 points): Exercise 5.2 [P].