Metraipolis › archive › dc_7a057260dc2c
Floridian Solitaire: A New Variant of Bulgarian Solitaire — arXiv:2608.08313
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.08313
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T09:08:51.186Z
- SHA-256 of the archived text
28d3bbe6c718f0b8e1ca1f47c9a861d88360c947eb38f0e638e5c42ce53a3937- Stable URL of this page
https://metraipolis.com/documento/dc_7a057260dc2c
How to cite
Floridian Solitaire: A New Variant of Bulgarian Solitaire — arXiv:2608.08313 — arXiv (en), https://arxiv.org/abs/2608.08313 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7a057260dc2c (Metraipolis archive dc_7a057260dc2c, sha256 28d3bbe6c718f0b8e1ca1f47c9a861d88360c947eb38f0e638e5c42ce53a3937)
BibTeX
@misc{dc7a057260dc2c,
title = {Floridian Solitaire: A New Variant of Bulgarian Solitaire — arXiv:2608.08313},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.08313},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7a057260dc2c; sha256 28d3bbe6c718f0b8e1ca1f47c9a861d88360c947eb38f0e638e5c42ce53a3937},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.08313. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Bulgarian solitaire is a well-studied, no-choice, no-loss, one-player game involving stacks of cards. More formally, it is a self-map on the set of partitions of a fixed integer $n.$ As a finite dynamical system, its long-term behavior is well understood. Every trajectory ends in a cycle. The partitions that are in a cycle are parameterized by binary vectors, and the cycles by binary necklaces. Call a partition separated if distinct part sizes differ by at least two. The vast majority of partitions belonging to a cycle are not separated. Motivated by this fact, we consider a variant where the player has choices, but is restricted to separated partitions and, if unable to make a legal move, may lose. We prove that for $n>73$, there are cycles, and hence winning initial positions. We analyze the game for small values of $n$ and describe computations which, together with our main result, show that there are cycles for $n \in \{2,6,8,11,14,16,18,21\}$ and for $n \ge 23$, but for no other $n.$
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-11 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.08313 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T09:05:33.551Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).