The arithmetic-periodicity of CUT for C={1,2c}
CUT is a class of partition games played on a finite number of finite piles of tokens. Each version of CUT is specified by a cut-set C⊆N. A legal move consists of selecting one of the piles and partitioning it into d+1 nonempty piles, where d∈C. No tokens are removed from the game. It turns out that...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Article |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://repository.li.mahidol.ac.th/handle/123456789/85108 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Mahidol University |
Be the first to leave a comment!