Generalizing OOOOOOB
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866911707748630528 |
|---|---|
| author | Danai, Alon Ellis, Paul Thanatipanonda, Thotsaporn Aek |
| author_facet | Danai, Alon Ellis, Paul Thanatipanonda, Thotsaporn Aek |
| contents | We present three versions of the classic two-pile game \textsc{one-or-one-or-one-of-both} generalized to the multi-pile context. In each case, we explore the resulting $\mathcal{P}$-positions. In the first version, there is a simple pattern. In the other two versions, we find partial solutions in each case through two experimental routes. First by limiting the number of piles, then by limiting the number of tokens per pile. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_23213 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Generalizing OOOOOOB Danai, Alon Ellis, Paul Thanatipanonda, Thotsaporn Aek Combinatorics We present three versions of the classic two-pile game \textsc{one-or-one-or-one-of-both} generalized to the multi-pile context. In each case, we explore the resulting $\mathcal{P}$-positions. In the first version, there is a simple pattern. In the other two versions, we find partial solutions in each case through two experimental routes. First by limiting the number of piles, then by limiting the number of tokens per pile. |
| title | Generalizing OOOOOOB |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2605.23213 |