Weekly exercises
Instructions for weekly exercise sessions: Attend one session on Tuesday, either 12:15-14:00 or 16:15-18:00. The sessions consists of exercises, and sometimes demonstrations by the assistant to more deeply illustrate topics covered in the lecture.
Results table: download PDF (April 29, 9:32)
Try to solve the exercises before the session (alone, no group work allowed!), and mark in the assistant's paper which solutions you are ready to present in the session. If you are chosen to present the solutions, you will get full bonus points from correct solutions as well as from reasonable attempts. If you have marked problems solved, but don't seem to have a clue about how it is solved (suggesting dishonesty on your part about marking exercises as solved, or not solving them youself), we will grant you negative points as a discouragement. Students not chosen to present will get full bonus points.
Exercise sessions are numbered according to the lectures they are related to: when Lecture N takes place on Thursday, the following Tuesday has exercise session N.
January 17, Exercise 2: Search algorithms
January 24, Exercise 3: Search algorithms 2 (some solutions)
January 31, Exercise 4: Logic and constraint satisfaction (some solutions)
February 7, Exercise 5: State-space search with logic and constraints (some solutions)
February 21, Exercise 6: Symbolic search, Markov decision processes (some solutions)
February 28, Exercise 7: Partial observability and decision-making under uncertainty
March 7, Exercise 8: Decision-making in adversarial and multi-agent settings
March 14, Exercise 9: Decision-making in multi-agent settings (some solutions)