Combinatorial Game Theory Seminar

Tomasz Maciosowski, Memorial University of Newfoundland

Abstract: In misère play, games are often compared modulo a universe, and the absolute comparison test decides this order recursively through the maintenance and proviso. In a blocking universe the P-free games form a subgroup of the invertible elements, but not a universe, and maintenance is not necessary for comparison modulo this subgroup, so the test does not apply there. We show how to replace a pair of P-free games by games equal to them for which the test does apply, and obtain a recursive comparison test for the invertible subgroup of a blocking universe.

This talk assumes no prior misère-specific knowledge and will include an introduction.

This is joint work with Svenja Huntemann and Rebecca Milley.

---

Location: ED4015

Date and Time: Monday, Sept. 21 at 11:30 AM - 12:30 PM (NDT)

---