Further hopping with toads and frogs
The electronic journal of combinatorics, Tome 18 (2011) no. 1
Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website
Zbl arXiv EuDML
We prove some new results about the combinatorial game "Toads and Frogs". We give a finite number of recurrence relations for computing the values of all positions with exactly one $\Box$. We show that ${\rm T}^{a}\Box\Box{\rm F}^{a}$ is an infinitesimal for $a\geq 4$. At the end, we make five new conjectures and describe possible future work.
DOI :
10.37236/554
Classification :
91A46
Mots-clés : toads, frogs, combinatorial games, Erickson's conjectures
Mots-clés : toads, frogs, combinatorial games, Erickson's conjectures
Thotsaporn "Aek" Thanatipanonda. Further hopping with toads and frogs. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/554
@article{10_37236_554,
author = {Thotsaporn "Aek" Thanatipanonda},
title = {Further hopping with toads and frogs},
journal = {The electronic journal of combinatorics},
year = {2011},
volume = {18},
number = {1},
doi = {10.37236/554},
zbl = {1217.91025},
url = {http://geodesic.mathdoc.fr/articles/10.37236/554/}
}
Cité par Sources :