Interesting CGT paper in the arXiv

Abstract to Doron Zeilberger and Aek Thanatipanonda's new paper, "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 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.

Fill-in-the-blank and complete the pun

Via Scot Morris:
* * * *

WITCH PARKING ONLY

VIOLATORS ____________________