arXiv · 0710.4951
A Symbolic Finite-state approach for Automated Proving of Theorems in Combinatorial Game Theory
Abstract
We 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.
Explore related subjects
Keep this discovery
Thotsaporn ``Aek'' Thanatipanonda, Doron Zeilberger. 2007-10-25. A Symbolic Finite-state approach for Automated Proving of Theorems in Combinatorial Game Theory. https://arxiv.org/abs/0710.4951
Cite the original work for its findings. Save a collection to share your selection of sources.