A Symbolic Finite-state approach for Automated Proving of Theorems in Combinatorial Game Theory

Simple item page
dc.creatorThanatipanonda, Thotsaporn ``Aek''
dc.creatorZeilberger, Doron
dc.date2007-10-25
dc.date.accessioned2026-07-07T08:38:45Z
dc.date.available2026-07-07T08:38:45Z
dc.descriptionWe develop a finite-state automata approach, implemented in a Maple package {\tt ToadsAndFrogs} available from our websites, for conjecturing, and then rigorously proving, values for large families of positions in Richard Guy's combinatorial game ``Toads and Frogs''. In particular, we prove a conjecture of Jeff Erickson.
dc.identifierhttps://arxiv.org/abs/0710.4951
dc.identifierhttp://arxiv.org/abs/0710.4951
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/140845
dc.subjectDynamical Systems
dc.subjectCombinatorics
dc.titleA Symbolic Finite-state approach for Automated Proving of Theorems in Combinatorial Game Theory
dc.typetext

Files

Collections

arXiv