A Symbolic Finite-state approach for Automated Proving of Theorems in Combinatorial Game Theory

Details A Symbolic Finite-state approach for Automated Proving of Theorems in Combinatorial Game Theory A Symbolic Finite-state approach for Automated Proving of Theorems in Combinatorial Game Theory

2007-10-25

arxiv.org/abs/0710.4951v1

Mathematics

Dynamical Systems

Scientific paper

We 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.

Affiliated with

Also associated with

No associations

Rating

A Symbolic Finite-state approach for Automated Proving of Theorems in Combinatorial Game Theory does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Symbolic Finite-state approach for Automated Proving of Theorems in Combinatorial Game Theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Symbolic Finite-state approach for Automated Proving of Theorems in Combinatorial Game Theory will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-190916