ToadsAndFrogs swMATH ID: 12648 Software Authors: Thanatipanonda, Thotsaporn Aek; Zeilberger, Doron Description: A symbolic finite-state approach for automated proving of theorems in combinatorial game theory. We develop a finite-state automata approach, implemented in a Maple package Toads and Frogs 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. Homepage: http://www.math.rutgers.edu/~zeilberg/tokhniot/ToadsAndFrogs Dependencies: Maple Keywords: combinatorial game theory; conjecture; finite-state method; recurrence Related Software: Maple Cited in: 2 Documents Standard Articles 1 Publication describing the Software, including 1 Publication in zbMATH Year A symbolic finite-state approach for automated proving of theorems in combinatorial game theory. Zbl 1232.91071Thanatipanonda, Thotsaporn “Aek”; Zeilberger, Doron 2009 Cited by 2 Authors 2 Thanatipanonda, Thotsaporn (Aek) 1 Zeilberger, Doron Cited in 2 Serials 1 Advances in Applied Mathematics 1 Journal of Difference Equations and Applications Cited in 2 Fields 2 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 1 Computer science (68-XX) Citations by Year