To contact JJ Vie, click the mail at the bottom of the page.
Lesson 1: Intro, Tue 12 Jan 13:30
See slides (soon)
Lesson 2: Pathfinding in Paris, Thu 14 Jan 8:00
Lessons 3 & 4: Dynamic Programming
Lesson 5: Dynamic Programming & Reinforcement Learning
- Introduction to Reinforcement Learning
- If there is still time, solve the jumping problem ($k$ students, $n$ floors)
Lesson 6 & 7: Matchings
- Book Club (SWERC 2014)
- Dungeon of Death
Lesson 8 & 9: Matchings & Flows
Please read these problems for next time. You can attempt a submission for the first two; for the third one only on the testcase given in example.
- See resource: Complexities of matching & flows algorithms
- Maximum Flow
- Hard: It Can Be Arranged
Lesson 10: Pathfinding and dynamic programming
Identify what is the dynamic programming objective in Bellman-Ford and Floyd-Warshall shortest path algorithms.
- Roads in Berland
- Negative Cycles
Lesson $N - 1 = 11$: Exam I
- By groups of 2 or 3
Lesson $N = 12$: Exam II