Games of Nim with Dynamic Restrictions
The authors present formulas for the previous player’s winning positions of two variants of restricted Nim. In both of these two games, there is one pile of stones, and in the first variant, we investigate the case that in <em>k</em>-th turn, you can remove <em>f</em>(<em>k</em>) stones at most, whe...
Сохранить в:
| Главные авторы: | , , , , |
|---|---|
| Формат: | Artigo |
| Язык: | Inglês |
| Опубликовано: |
InaCombS; Universitas Jember; dan Universitas Indonesia
2025-07-01
|
| Серии: | Indonesian Journal of Combinatorics |
| Предметы: | |
| Online-ссылка: | http://www.ijc.or.id/index.php/ijc/article/view/219 |
| Метки: |
Нет меток, Требуется 1-ая метка записи!
|