Speaker: Peter Selinger, Dalhousie University
Location: Dalhousie University, Chase 227, or online via ZOOM
Title: On 3-terminal positions in Hex
Abstract:
Combinatorial game theory is a formalism for analyzing sequential perfect information games that was introduced by Berlekamp, Conway, and Guy. There are various flavours of combinatorial game theory, for example, for normal play (where the last person to make a move wins), misère play (where the last person to make a move loses), and for scoring games (where the player with the higher score wins). In this talk, I'll discuss a flavour of combinatorial games that is appropriate for monotone set colouring games such as Hex. I'll apply this theory to solve some open problems in Hex. This is joint work with Eric Demer.
Zoom link: