Variants of Wythoff game with terminal positions or blocking maneuvers
Preprint
Abstract
We show how the software Walnut can be used to obtain concise proofs of results concerning variants of the famous Wythoff game, in which blocking maneuvers or terminal positions are added, as discussed respectively by Larsson (2011) and Komak et al. (2025). Our approach provides automatic proofs that both confirm and extend their results, and the same techniques apply to newly introduced variants as well. Then, using classic techniques, we obtain new recursive and morphic characterizations of Wythoff-type games where the set of terminal positions $(x,y)$ satisfy $x+y\le\ell$. The use of Walnut in combinatorial game theory is relatively recent, and only a few examples have been explored so far. The Wythoff game, being directly connected to the Fibonacci numeration system, proves especially well-suited to this kind of approach. It permits us to solve instances for a fixed value of a parameter.
Keywords
All Related Versions
This publication has 10 references indexed in Scilit:
- Automatic proofs in combinatorial game theoryInternational Journal of Game Theory, 2025
- Linear Complementary Equations and SystemsThe Fibonacci Quarterly, 2019
- Blocking Wythoff NimThe Electronic Journal of Combinatorics, 2011
- Extensions and restrictions of Wythoff's game preserving its positionsJournal of Combinatorial Theory, Series A, 2010
- A morphic approach to combinatorial games: the Tribonacci caseRAIRO - Theoretical Informatics and Applications, 2007
- Heap games, numeration systems and sequencesAnnals of Combinatorics, 1998
- Bertrand numeration systems and recognizabilityTheoretical Computer Science, 1997
- A strange recursive relationJournal of Number Theory, 1988
- “Curiouser and curiouser” said alice. further reflections on an interesting recursive functionInternational Journal of Computer Mathematics, 1988
- Nonhomogeneous spectra of numbersDiscrete Mathematics, 1981