A morphic approach to combinatorial games: the Tribonacci case
Open Access
- 13 December 2007
- journal article
- research article
- Published by EDP Sciences in RAIRO - Theoretical Informatics and Applications
- Vol. 42 (2) , 375-393
Abstract
We propose a variation of Wythoff's game on three piles of tokens, in the sense that the losing positions can be derived from the Tribonacci word instead of the Fibonacci word for the two piles game. Thanks to the corresponding exotic numeration system built on the Tribonacci sequence, deciding whether a game position is losing or not can be computed in polynomial time.Keywords
This publication has 13 references indexed in Scilit:
- Some properties of the Tribonacci sequenceEuropean Journal of Combinatorics, 2007
- Substitutions in Dynamics, Arithmetics and Combinatorics2002
- Heap games, numeration systems and sequencesAnnals of Combinatorics, 1998
- Combinatorics on Words1997
- Systems of NumerationThe American Mathematical Monthly, 1985
- How to Beat Your Wythoff Games' Opponent on Three FrontsThe American Mathematical Monthly, 1982
- Nombres algébriques et substitutionsBulletin de la Société Mathématiques de France, 1982
- Nonhomogeneous spectra of numbersDiscrete Mathematics, 1981
- A generalization of Wythoff's gameJournal of Combinatorial Theory, Series A, 1973
- Uniform tag sequencesTheory of Computing Systems, 1972