$m$-Modular Wythoff
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2016
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911780660314112 |
|---|---|
| author | Khovanova, Tanya Niu, Shuheng |
| author_facet | Khovanova, Tanya Niu, Shuheng |
| contents | We introduce a variant of Wythoff's Game that we call $m$-Modular Wythoff's Game. In the original Wythoff's Game, players can take a positive number of tokens from one pile, or they can take a positive number of tokens from both piles if the number of tokens they take from the first pile is equal to the number of tokens they take from the second. In our variant, we weaken this equality condition to one of equivalence modulo $m$. We characterize the P-positions of our $m$-Modular variant as a finite subset of the P-positions of the known P-positions of the original Wythoff's Game. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1608_01025 |
| institution | arXiv |
| publishDate | 2016 |
| record_format | arxiv |
| spellingShingle | $m$-Modular Wythoff Khovanova, Tanya Niu, Shuheng Combinatorics 91A46 We introduce a variant of Wythoff's Game that we call $m$-Modular Wythoff's Game. In the original Wythoff's Game, players can take a positive number of tokens from one pile, or they can take a positive number of tokens from both piles if the number of tokens they take from the first pile is equal to the number of tokens they take from the second. In our variant, we weaken this equality condition to one of equivalence modulo $m$. We characterize the P-positions of our $m$-Modular variant as a finite subset of the P-positions of the known P-positions of the original Wythoff's Game. |
| title | $m$-Modular Wythoff |
| topic | Combinatorics 91A46 |
| url | https://arxiv.org/abs/1608.01025 |