Coursera – Games without Chance – Combinatorial Game Theory – Georgia Tech[32 Mp4, 32 srt, 32 txt]
English | Size: 538.61 MB
Category:Tutorial

This course explores the mathematical theory of two player games without chance moves. We will cover simplifying games, determining when games are equivalent to numbers, and impartial games. Many of the examples will be with simple games that may be new to you: Hackenbush, Nim, Push, Toads and Frogs, and others. While this probably won’t make you a better chess or go player, the course will give you a better insight into the structure of games.
[Read more…]