pith. sign in

arxiv: 1309.1631 · v1 · pith:SPBLEBDPnew · submitted 2013-09-06 · 🧮 math.CO

Partizan Kayles and Misere Invertibility

classification 🧮 math.CO
keywords kaylesmiserepartizanpinsgameinverseinvertibilityonly
0
0 comments X
read the original abstract

The impartial combinatorial game Kayles is played on a row of pins, with players taking turns removing either a single pin or two adjacent pins. A natural partizan variation is to allow one player to remove only a single pin and the other only a pair of pins. This paper develops a complete solution for "Partizan Kayles" under misere play, including the misere monoid all possible sums of positions, and discusses its significance in the context of misere invertibility: the universe of Partizan Kayles contains a position whose additive inverse is not its negative, and, moreover, this position is an example of a right-win game whose inverse is previous-win.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.