BEGIN:VCALENDAR
VERSION:2.0
PRODID:-// - ECPv5.3.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://aarms.math.ca
X-WR-CALDESC:Events for 
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20180101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;VALUE=DATE:20180601
DTEND;VALUE=DATE:20180605
DTSTAMP:20260507T155518
CREATED:20180125T201802Z
LAST-MODIFIED:20180125T222501Z
UID:2641-1527811200-1528156799@aarms.math.ca
SUMMARY:CMS Special Session: Combinatorial Game Theory
DESCRIPTION: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. \nThis 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. \nCo-organizers: Svenja Huntemann (Dalhousie University)\, Rebecca Milley (Grenfell Campus\, Memorial University of Newfoundland)
URL:https://aarms.math.ca/event/cms-special-session-combinatorial-game-theory/
LOCATION:University of New Brunswick (Fredericton Campus)\, Fredericton\, New Brunswick\, Canada
CATEGORIES:AARMS sponsored events
ORGANIZER;CN="Neil%20McKay":MAILTO:neil.mckay@unb.ca
END:VEVENT
END:VCALENDAR