Combinatorial Game Theory studies finite, two-player games in which there are no ties. Techniques from logic combinatorics and set theory are used to prove various properties of such games. Typical games include Domineering, Hackenbush, and Nim. The analysis of such games can also be used to study other more complex games like Dots and Boxes, and Go. Topics covered in this course include Conway'92s theory of numbers as games, impartial and partizan games, winning strategies, outcome classes and algebra of games.
Prerequisites
MAT 258