On the $\mathcal{P}$-positions of some infinite families of Slow $A$-Nim
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914499711205376 |
|---|---|
| author | Heubach, Silvia Dufour, Matthieu |
| author_facet | Heubach, Silvia Dufour, Matthieu |
| contents | We introduce the game Slow $A$-Nim which generalizes a number of recently studied games. Slow $A$-Nim is played on $n$ stacks of tokens, and the set $A$ indicates the number of stacks a player can play on. Once a player has decided on the number $a$ of stacks, s/he will select any $a$ stacks and then remove one token from each stack. The last player to move wins. We give results on the $\mathcal{P}$-positions of Slow $A$-Nim for several infinite families. The results for $A = \{n-1\}$, which is the game Slow Exact $k$-Nim for $k=n-1$ extend recent results for small values of $n$. The other two families, $A=\{n-1,n\}$ and $A=\{1,n\}$ have not been previously studied. The $\mathcal{P}$-positions for $A = \{n-1\}$ and $A = \{n-1,n\}$ are closely related and have a very elegant description in terms of reduced positions, that is, positions for which unplayable tokens are disregarded. We also provide some general results that will be useful in the study of other sets $A$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_06608 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On the $\mathcal{P}$-positions of some infinite families of Slow $A$-Nim Heubach, Silvia Dufour, Matthieu Combinatorics 91A46 (Primary) 91A05 (Secondary) We introduce the game Slow $A$-Nim which generalizes a number of recently studied games. Slow $A$-Nim is played on $n$ stacks of tokens, and the set $A$ indicates the number of stacks a player can play on. Once a player has decided on the number $a$ of stacks, s/he will select any $a$ stacks and then remove one token from each stack. The last player to move wins. We give results on the $\mathcal{P}$-positions of Slow $A$-Nim for several infinite families. The results for $A = \{n-1\}$, which is the game Slow Exact $k$-Nim for $k=n-1$ extend recent results for small values of $n$. The other two families, $A=\{n-1,n\}$ and $A=\{1,n\}$ have not been previously studied. The $\mathcal{P}$-positions for $A = \{n-1\}$ and $A = \{n-1,n\}$ are closely related and have a very elegant description in terms of reduced positions, that is, positions for which unplayable tokens are disregarded. We also provide some general results that will be useful in the study of other sets $A$. |
| title | On the $\mathcal{P}$-positions of some infinite families of Slow $A$-Nim |
| topic | Combinatorics 91A46 (Primary) 91A05 (Secondary) |
| url | https://arxiv.org/abs/2404.06608 |