311 citations · 1.2k across the 38 of their papers we have counts for
Showing 2021 · math.COShow all
2 papers · 2 filters
math.CO2021
All passable games are realizable as monotone set coloring games
Eric Demer, Peter Selinger, Kyle Wang
The class of passable games was recently introduced by Selinger as a class of combinatorial games that are suitable for modelling monotone set coloring games such as Hex. In a mono…
math.CO2021★ 1 cited
On the combinatorial value of Hex positions
Peter Selinger
We develop a theory of combinatorial games that is appropriate for describing positions in Hex and other monotone set coloring games. We consider two natural conditions on such gam…