Simple Chopsticks: Playing with any number of hands and fingers
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866917692828549120 |
|---|---|
| author | Dailly, Antoine Gledel, Valentin Nowakowski, Richard J. Santos, Carlos Pereira dos |
| author_facet | Dailly, Antoine Gledel, Valentin Nowakowski, Richard J. Santos, Carlos Pereira dos |
| contents | Chopsticks is a game played by two players where they start with one finger raised on each hand. On their turn, each player moves by pointing an attacking hand at one of their opponent's hands. The number of fingers on the pointed hand increases by the number of fingers on the attacking hand. If, after a move, a hand contains more than five fingers, it is removed from play. There are also other rules that allow players to move fingers from one hand to another, but we focus on this simple setup.
We introduce a generalization of Chopsticks, called Simple Chopsticks, in which the players may have any number of $n$-fingered hands. We find that having more hands than your opponent is generally good, and use this fact to fully characterize the outcomes of \octopus/ in the case where the players have 2-fingered hands. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_09083 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Simple Chopsticks: Playing with any number of hands and fingers Dailly, Antoine Gledel, Valentin Nowakowski, Richard J. Santos, Carlos Pereira dos Combinatorics Chopsticks is a game played by two players where they start with one finger raised on each hand. On their turn, each player moves by pointing an attacking hand at one of their opponent's hands. The number of fingers on the pointed hand increases by the number of fingers on the attacking hand. If, after a move, a hand contains more than five fingers, it is removed from play. There are also other rules that allow players to move fingers from one hand to another, but we focus on this simple setup. We introduce a generalization of Chopsticks, called Simple Chopsticks, in which the players may have any number of $n$-fingered hands. We find that having more hands than your opponent is generally good, and use this fact to fully characterize the outcomes of \octopus/ in the case where the players have 2-fingered hands. |
| title | Simple Chopsticks: Playing with any number of hands and fingers |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2406.09083 |