# Lectures
📗 Slides (before lecture, usually updated on Sunday): 
Blank Slides:
Part 1,
Part 2,
Blank Slides (with blank pages for quiz questions):
Part 1,
Part 2,
📗 Slides (after lecture, usually updated on Friday): 
Blank Slides with Quiz Questions:
Part 1,
Part 2,
Annotated Slides:
Part 1,
Part 2,
📗 Review Session:
PDF. 
Saturday: 
PDF. 
📗 My handwriting is really bad, you should copy down your notes from the lecture videos instead of using these. 
📗 Notes 
 
Images from the Christopher Nolan movie 
"Dark Knight" (2008) copyright 
Warner Bros.. 
 
# Other Materials
📗 Pre-recorded Videos from 2020 
Lecture 21 Part 1 (Adversarial Search): 
Link 
Lecture 21 Part 2 (Alpha Beta Pruning): 
Link 
Lecture 21 Part 3 (Heuristic): 
Link 
Lecture 22 Part 1 (Rationalizability): 
Link 
Lecture 22 Part 2 (Nash Equilibrium): 
Link 
Lecture 22 Part 3 (Mixed Strategies): 
Link 
📗 Relevant websites 
Tic Tac Toe: 
Link 
Nim Game: 
Link 1, 
Link 2 
Rock paper scissors: 
Link, 
Link, 
Link 
Prisoner Dilemma: 
Link 
Median Voter Theorem: 
Link 
Volunteer's Dilemma: 
Link 
First and Second Price Auction: 
Link 
Split or Steal: 
Video, 
Playlist 
📗 YouTube videos from 2019 and 2020 
How to solve a simple game with Chance? 
Link 
How to figure out which branches can be pruned using Alpha Beta algorithm? Simple example: 
Link, Complicated example: 
Link 
How to find the Nash equilibrium of a zero sum game? 
Link 
How to do iterated elimination of strictly dominated strategies (IESDS)? 
Link 
How to find the mixed strategy Nash equilibrium of a simple 2 by 2 game? 
Link 
What is the median voter theorem? 
Link 
How to guess and check a mixed strategy Nash equilibrium of a simple 3 by 3 game? 
Link 
How to solve the mixing probabilities of the volunteer's delimma game? 
Link 
How to solve the Rubinstein Bargaining problem? 
Link