# Summary

M11, M12,
P6,
Q20, Q22, Q23, Q24,

# Lectures

Lecture 21: Slides.
Lecture 22: Slides.

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


Images from the Christopher Nolan movie "Dark Knight" (2008) copyright Warner Bros..

# Other Materials

Tic Tac Toe: Link
Nim Game: Link 1, Link 2
Rock paper scissors: Link 1, Link 2
Prisoner Dilemma: Link
Median Voter Theorem: Link
Volunteer's Dilemma: Link
First and Second Price Auction: Link
Split or Steal: Video, Playlist

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