Lecture 15 -  Backward induction: chess, strategies, and credible threats thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Lecture 15 - Backward induction: chess, strategies, and credible threats

Published on Nov 15, 20103239 Views

We first discuss Zermelo's theorem: that games like tic-tac-toe or chess have a solution. That is, either there is a way for player 1 to force a win, or there is a way for player 1 to force a tie, or

Related categories