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 |
| Ετικέτες: |
Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!
|