Do the following exercises from the text:

1. Exercise 6.3, both parts - Please give a one-paragraph solution to each part. Note that you are specifying the problem, not implementing it. There may be more than one way to specify things; choose one.

2. Exercise 6.4.b - Formulate a course-scheduling domain and implement it using the AIMA constraint satisfaction framework. Note the following:

   • Your solution should represent courses (e.g., cs108, cs112, ...), faculty (e.g., adams, hplantin, ...), course assignments (e.g., nelesen teaches 108, adams teaches cs112, ...), (disjoint!) time slots (mwf900, tth1030) and rooms (e.g., nh253, sb382).
   • The constraints are the obvious ones: each course should be offered exactly once by the assigned faculty member, a faculty member can only teach one thing at a time and a room can only have one class at each time.
   • You don’t need to create a full schedule for the department, but do include examples with around a half-dozen courses, faculty, times, rooms, etc. to demonstrate that your mechanism works.
   • Choose the algorithm you think is most appropriate and document why you chose it.

   There are a number of ways to formulate this; choose one and demonstrate that it works. As with the previous programming assignments, you won’t need to write much code to solve this problem; you just need to specify the problem appropriately and let the CSP do its work.

Final project suggestion: Consider applying local search to complex design tasks such as graphical layout design or course scheduling for Calvin.

Checking in

Submit the files specified above in Moodle under homework 4. We will grade your work according to the following criteria:

• 25% - Exercise 1- Write brief but compelling answers to the given questions.
• 75% - Exercise 2 - Build correct, efficient and understandable code that solves the given problem.