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 |
| 主題: | |
| オンライン･アクセス: | http://www.ijc.or.id/index.php/ijc/article/view/219 |
| タグ: |
タグなし, このレコードへの初めてのタグを付けませんか!
|