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

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.

Keywords

Dynamical Systems, Combinatorics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/140845

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0710.4951
 http://arxiv.org/abs/0710.4951

Collections

arXiv