Points for each assignment.

• HW1: Total 10 points. Exercise at the end of Ch.1[L]. 1 point off for each late day, per grade policy. No credit if homework is turned in after 1315 on Tuesday, January 17, 2017. 2 points off for one or two computational errors. 2 points off for not guessing what the procedure does. 2 points off for interpreting ^ as exponentiation. Other errors may result in further deductions.
• HW2: Total 12 points. Exercise 5.5[L]. 1 point off for each late day, per grade policy. No credit if homework is turned in after 1315 on Thursday, February 7, 2017. 2 points off for missing example of use. 2 points off for missing write statements. 1 point off if lists are used. 2 points off for wrong answer. At least 6 points off if the program does not run.
• HW3: Total 20 points. 2 points for beside, 2 points for above. 2 point for each of size, shape, and color query. 2 points for each of the three np queries that must succeed. 4 points for put_on. If the code does not compile, at most 6 points.
• HW4 (total: 25 points). 3.3 [P]: 5 points for part (a), 3 points for Manhattan distance, and 2 points for the numbering of node expansions and the path for part (b), 4 points for part (c), 4 points for part (d), 4 points for part (e), 1 point for part (f), 2 points for part (g): 25 points total
• HW5 (total: 12 points). 3.4 [P]: 7 points for part (a), 4 points for the first part of (b), 1 point for the second part of (b) (monotonicity): 12 points total.
• HW6 (total: 16 points) 4.1 [P} (11 points) parts a-c only (3 per part); drawing the constraint network for the second representation: 2 points. 4.11 [P](5 points): 2 points for part (a), 3 points for part (b).