A symbolic finite-state approach for automated proving of theorems in combinatorial game theory
Thotsaporn Thanatipanonda, Doron Zeilberger · The Journal of Difference Equations and Applications · 2008
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.