Geodesic
One pile Nim with arbitrary move function
The electronic journal of combinatorics, Tome 10 (2003)

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl EuDML
This paper solves a class of combinatorial games consisting of one-pile counter pickup games for which the maximum number of counters that can be removed on each successive move equals $f(t)$, where $t$ is the previous move size and $f$ is an arbitrary function.
DOI : 10.37236/1747
Classification : 91A46, 11B37
Mots-clés : Nim games 
Arthur Holshouser; Harold Reiter. One pile Nim with arbitrary move function. The electronic journal of combinatorics, Tome 10 (2003). doi: 10.37236/1747
@article{10_37236_1747,
     author = {Arthur Holshouser and Harold Reiter},
     title = {One pile {Nim} with arbitrary move function},
     journal = {The electronic journal of combinatorics},
     year = {2003},
     volume = {10},
     doi = {10.37236/1747},
     zbl = {1047.91009},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1747/}
}
TY  - JOUR
AU  - Arthur Holshouser
AU  - Harold Reiter
TI  - One pile Nim with arbitrary move function
JO  - The electronic journal of combinatorics
PY  - 2003
VL  - 10
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1747/
DO  - 10.37236/1747
ID  - 10_37236_1747
ER  - 
%0 Journal Article
%A Arthur Holshouser
%A Harold Reiter
%T One pile Nim with arbitrary move function
%J The electronic journal of combinatorics
%D 2003
%V 10
%U http://geodesic.mathdoc.fr/articles/10.37236/1747/
%R 10.37236/1747
%F 10_37236_1747

Cité par Sources :