2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/140845We 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.Dynamical SystemsCombinatoricsA Symbolic Finite-state approach for Automated Proving of Theorems in Combinatorial Game Theorytext