this course is about two kinds of game theory:

classical game theory (a.k.a. economic game theory), as developed by Von Neumann, Gayle, Shipley, Nash et al

combinatorial game theory, as developed by Berlekamp, Conway, Guy, Nowakowski, et al. developed cgt.

course follows text by DeVos and Kent

UAlberta students can access text here

course covers some of these topics

combinatorial games

normal-play games

impartial games,

hackenbush and partizan games

zero-sum matrix games

von neumann's minimax theorem

general games

nash equilibrium

cooperation

n-player games

preferences and society

who is welcome?

anyone interested in classic game theory and/or combinatorial game theoryis this course cross-listed?

sometimes as ugrad CMPUT 497-B2prereqs?

CMPUT 175 (or equiv), any of CMPUT 272, MATH 222, PHIL 220, and any CMPUT/MATH/PHIL 3xxlabs or seminars?

nowhat is this course about?

we will follow Game Theory: A Playful Introduction by DeVos and Kent, available as a pdf from UAlberta library cgt, a.k.a. board game math, applies to 2-player alternate turn perfect-information deterministic games, especially those where the loser is whoever cannot make a legal move

wikipedia (read 1st para)is there math in this course?

yes, and proofs.is there computing in this course?

possiblyis this relevant to computing?

yes, game-bots use search and knowledge, this course covers knowledge common to many 2-player games, e.g. some Go end-game solvers use CGT, some imperfect-info game solvers use classic GTcalendar description?

(3-0-0) CMPUT 497-B2 / 670

an introduction to classic game theory and to combinatorial game theoryCGT course content?

other CGT sources**Intro to Combinatorial Game Theory**(Haff/Garner),**Lessons in Play**(Nowakowski et al.)algorithmic course content? CMPUT 355: games, puzzles, algorithms and other sources on simple game players/solvers

comb'l games

hex

benzene(MoHex 2.0) Nicolas patterns branch neurobenzene install tips

jakub's improved vcs, mohex patterns, spdfpn

mopyhex kenny's python hex player

kenny's fuego for kenny's osx-benzene

rex kenny's rex solver mohex:dfpn (ignore all other code)

hex 122 kenny's morat branc:hex122cleaned Hex 122 player

bridgit thiessen

reverse hex mcts bot

dark hex umpire old sourceforge

go

game-diagram drawing software

An Introduction to Combinatorial Game Theory by L R Haff and W J Garner (ugrad level)

order from lulu.com (not amazon) to get the most recent edition

Len Haff is an emeritus professor of mathematics at UC San Diego. He is also an enthusiastic Go player who became interested in Combinatorial Game Theory long ago. He's been teaching a course on combinatorial game theory for many years. Will Garner is his former student, who joined him in teaching CGT for several years. Like Lessons in Play, by Albert, Nowakowski, and Wolfe, An Introduction to Combinatorial Game Theory by Haff & Garner is a textbook for an undergraduate course. It addresses the transition from lower division (freshman & sophomore) collegiate mathematics to upper division, with increased emphasis on rigorous proofs. I think everyone who teaches an undergraduate course on CGT should take a close look at it. – Elwyn Berlekamp

Lessons in Play by M Albert, R Nowakowski, D Wolfe (ugrad level)

Combinatorial games are games of pure strategy involving two players, with perfect information and no element of chance. Starting from the very basics of gameplay and strategy, the authors cover a wide range of topics, from game algebra to special classes of games. Classic techniques are introduced and applied in novel ways to analyze both old and new games, several appearing for the first time in this book.

Game Theory: A Playful Introduction by Matt Devos and Deborah A Kent (ugrad level)

This book offers a gentle introduction to the mathematics of both sides of game theory: combinatorial and classical. The combination allows for a dynamic and rich tour of the subject united by a common theme of strategic reasoning. The first four chapters develop combinatorial game theory, beginning with an introduction to game trees and mathematical induction, then investigating the games of Nim and Hackenbush. The analysis of these games concludes with the cornerstones of the Sprague-Grundy Theorem and the Simplicity Principle. The last eight chapters of the book offer a scenic journey through the mathematical highlights of classical game theory. This contains a thorough treatment of zero-sum games and the von Neumann Minimax Theorem, as well as a student-friendly development and proof of the Nash Equilibrium Theorem. The Folk Theorem, Arrow's voting paradox, evolutionary biology, cake cutting, and other engaging auxiliary topics also appear. The book is designed as a textbook for an undergraduate mathematics class. With ample material and limited dependencies between the chapters, the book is adaptable to a variety of situations and a range of audiences. Instructors, students, and independent readers alike will appreciate the flexibility in content choices as well as the generous sets of exercises at various levels.

Combinatorial Game Theory by Aaron N Siegel (expert level)

For those wishing to know about combinatorial games in depth this is the book to read. … Aaron Siegel is currently the strongest researcher in the field and has been involved with many of the central developments. In this book, he has brought them together. Moreover, he includes asides and details that explain how and why certain directions were taken; important insights from an expert. … He has kept the tone of the book light and infused it with history, anecdotes, and important observations making it an entertaining as well as an educational read. – Richard Nowakowski, MAA Reviews

some lectures

all online lectures are recorded on zoom (see eclass/references)

homework (497+670)

discuss homeworks only within your assigned homework group

quizzes (497+670)

coming soon

project (670 only)