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

Citations by Year