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.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element