Misère Cricket Pitch
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866929605894471680 |
|---|---|
| author | Nowakowski, Richard J. Saunders, Ethan J. |
| author_facet | Nowakowski, Richard J. Saunders, Ethan J. |
| contents | Misère games in general have little algebraic structure, but if the games under consideration have properties then some algebraic structure re-appears. In 2023, the class of Blocking games was identified. Misère Cricket Pitch was suggested as a problem at the Games-at-Dal-2023 Workshop, and is the first game in this class to be studied. Normal play Cricket Pitch was analyzed in 2011.
The game involves flattening `bumps' with a roller. The main reduction of normal play, reducing every bump by $2$, is not applicable in misère play.
In this paper, we find the outcomes of single (linear) component \textsc{cricket pitch} positions, where
the proof is based on first considering the bumps to the left and to the right of the roller separately. We also give reductions, true in Blocking games in general, of positions that occur in simple positions of Cricket Pitch. These allow us to find the outcomes of the disjunctive sum of single bump positions. At the time of writing, it was not possible to find game values since the relevant theory for Blocking games does not exist. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_17518 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Misère Cricket Pitch Nowakowski, Richard J. Saunders, Ethan J. Combinatorics 91A46 Misère games in general have little algebraic structure, but if the games under consideration have properties then some algebraic structure re-appears. In 2023, the class of Blocking games was identified. Misère Cricket Pitch was suggested as a problem at the Games-at-Dal-2023 Workshop, and is the first game in this class to be studied. Normal play Cricket Pitch was analyzed in 2011. The game involves flattening `bumps' with a roller. The main reduction of normal play, reducing every bump by $2$, is not applicable in misère play. In this paper, we find the outcomes of single (linear) component \textsc{cricket pitch} positions, where the proof is based on first considering the bumps to the left and to the right of the roller separately. We also give reductions, true in Blocking games in general, of positions that occur in simple positions of Cricket Pitch. These allow us to find the outcomes of the disjunctive sum of single bump positions. At the time of writing, it was not possible to find game values since the relevant theory for Blocking games does not exist. |
| title | Misère Cricket Pitch |
| topic | Combinatorics 91A46 |
| url | https://arxiv.org/abs/2411.17518 |