CMPUT 655 - Algorithms in Combinatorial Game Theory
*Note: Topic has been changed to avoid a big overlap with CMPUT 657.
Overview
Combinatorial game theory studies two player games which have structure: a game consists of several independent subgames, and a player must choose to play in one of them at each turn. Examples are the games of Nim, Amazons, endgames in the game of Go, and many others.
In this course we study the basic concepts of combinatorial game theory and the algorithms that can be used to play such games well, or solve them efficiently. We will proceed from basic concepts to the current state of the art.
Objectives
- Become familiar with basic concepts of combinatorial game theory and many examples of such games
- Study, implement, and experiment with both exact and approximate algorithms to play and solve such games.
Course Work
- Readings and Quizzes
- Assignments
- Project
- Presentations