Meeting 1 at 6 pm: Introduction, history of AI, search space graphs.

Meeting 2 at 6 pm: Uninformed search — breadth-first, depth-first, and uniform-cost. Read ch. 2. Assignment 1 due at 1 am.

Meeting 3 at 6 pm: Informed search — best-first and A*. Read ch. 3 thru p. 65. Quiz 1. Assignment 2 due at 1 am.

Meeting 4 at 6 pm: Constraint satisfaction. Read p. 81–86 of ch. 3. Quiz 2.

Meeting 5 at 6 pm: Minimax game search. Read ch. 4 thru p. 109. Assignment 3 due at 1 am.

Meeting 6 at 6 pm: Video game AI. Read p. 121–139 of ch. 4. Quiz 3.

Meeting 7 at 6 pm: Knowledge representation and logic. Read ch. 5 thru p. 163. Assignment 4 due at 1 am.

Midterm exam at 6 pm:

Meeting 9 at 6 pm: Supervised learning with decision trees. Read ch. 6 thru p. 176.

Meeting 10 at 6 pm: Unsupervised learning with Markov models. Read p. 176–193 of ch. 6.

Meeting 11 at 6 pm: Evolutionary computation — genetic algorithms. Read ch. 7 thru p. 211. Quiz 4.

Assignment 5 due at 1 am.

Meeting 12 at 6 pm: Genetic programming. Read p. 211–220 of ch. 7. Quiz 5.

Meeting 13 at 6 pm: Perceptrons and neural network architecture. Read ch. 8 thru p. 261. Assignment 6 due at 1 am.

Meeting 14 at 6 pm: Neural network learning with LMS and back-propagation. Read p. 262–275 of ch. 8. Quiz 6.

Assignment 7 due at 1 am.

Final exam at 6 pm: