Further hopping with Toads and Frogs

Thotsaporn Aek Thanatipanonda

doi:10.37236/554

Further hopping with Toads and Frogs

Thotsaporn Aek Thanatipanonda

Johannes Kepler University Linz

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

Abstract

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 □. We show that T^a□□F^a is an infinitesimal for a ≥ 4. At the end, we make five new conjectures and describe possible future work.

Original language	English
Journal	Electronic Journal of Combinatorics
Volume	18
Issue number	1
DOIs	https://doi.org/10.37236/554
Publication status	Published - 2011
Externally published	Yes

Access to Document

10.37236/554

Cite this

@article{7aea0f42585b4c3b833f65ba09c336a3,

title = "Further hopping with Toads and Frogs",

abstract = "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 □. We show that Ta□□Fa is an infinitesimal for a ≥ 4. At the end, we make five new conjectures and describe possible future work.",

author = "Thanatipanonda, \{Thotsaporn Aek\}",

year = "2011",

doi = "10.37236/554",

language = "English",

volume = "18",

journal = "Electronic Journal of Combinatorics",

issn = "1077-8926",

publisher = "Australian National University",

number = "1",

}

TY - JOUR

T1 - Further hopping with Toads and Frogs

AU - Thanatipanonda, Thotsaporn Aek

PY - 2011

Y1 - 2011

N2 - 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 □. We show that Ta□□Fa is an infinitesimal for a ≥ 4. At the end, we make five new conjectures and describe possible future work.

AB - 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 □. We show that Ta□□Fa is an infinitesimal for a ≥ 4. At the end, we make five new conjectures and describe possible future work.

UR - https://www.scopus.com/pages/publications/79955711317

U2 - 10.37236/554

DO - 10.37236/554

M3 - Article

AN - SCOPUS:79955711317

SN - 1077-8926

VL - 18

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

IS - 1

ER -

Further hopping with Toads and Frogs

Abstract

Access to Document

Other files and links

Fingerprint

Cite this