A symbolic finite-state approach for automated proving of theorems in combinatorial game theory

DOI10.1080/10236190802006423zbMath1232.91071arXiv0710.4951OpenAlexW2020209896MaRDI QIDQ3600655

Thotsaporn ``Aek Thanatipanonda, Doron Zeilberger

Publication date: 5 February 2009

Published in: Journal of Difference Equations and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0710.4951

zbMATH Keywords

recurrenceconjecturecombinatorial game theoryfinite-state method

Mathematics Subject Classification ID

Combinatorial games (91A46)

Related Items (3)

Rook endgame problems in \(m\) by \(n\) chess ⋮ Game of pure chance with restricted boundary ⋮ ToadsAndFrogs

Uses Software

• Unnamed Item

Cites Work

• Unnamed Item

This page was built for publication: A symbolic finite-state approach for automated proving of theorems in combinatorial game theory