GAMES WITHOUT CHANCE: COMBINATORIAL GAME THEORY
******************************************************
Taught by Tom Morley
Published by the Georgia Institute of Technology and Coursera
Compiled by the Free Library and Uploaded by rndNbr in March 2014
======================================================
Thank you for downloading this educational resource. If you are satisfied with it, I only ask you to seed its torrent or pass it on in some way for someone else's use.
If you have any comments, questions, or suggestions, if you would like information on other free educational resources, or if you would like to contribute, please contact us at [email protected].
If you would like to donate, support free education by donating to Khan Academy:
http://khanacademy.org/donate
Thank you.
The Free Library
======================================================
This course includes the video lectures (MP4), their subtitles (SRT), transcripts (TXT), and any lecture resources that were provided by the professor(s).
======================================================
This is version 002 of this course. It ended in February/March 2014.
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 wont make you a better chess or go player, the course will give you a better insight into the structure of games.
More information about this course is available at https://coursera.org/course/cgt
All Comments