CMS Special Session: Combinatorial Game Theory

Placement games are a class of combinatorial games (two-player, perfect information) that have received renewed attention recently. Well known examples are Hex, Domineering, and Snort. Work on placement games can be divided into two main streams – studies focusing on a specific game and those looking at properties of the entire class. The latter approach is in particular new. Placement games have connections to many other areas, for example graph theory, set theory, and commutative algebra. It is often feasible to count exactly the number of legal positions in a placement game, but this is not generally the case for combinatorial games.

This session at the 2018 CMS summer meeting is intended for researchers working in this area to exchange ideas and approaches; our goal is to expand the toolbox available for studying games in this class and to better understand the class itself.

Co-organizers: Svenja Huntemann (Dalhousie University), Rebecca Milley (Grenfell Campus, Memorial University of Newfoundland)