Journal of Combinatorial Theory Series A
Bertrand numeration systems and recognizability
Theoretical Computer Science - Special issue: Latin American theoretical informatics
On the sequentiality of the successor function
Information and Computation
More on generalized automatic sequences
Journal of Automata, Languages and Combinatorics
Automatic Sequences: Theory, Applications, Generalizations
Automatic Sequences: Theory, Applications, Generalizations
Complexity, appeal and challenges of combinatorial games
Theoretical Computer Science - Algorithmic combinatorial game theory
Theoretical Computer Science
Numeration systems: a link between number theory and formal language theory
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Complementary Iterated Floor Words and the Flora Game
SIAM Journal on Discrete Mathematics
Two variants of Wythoff's game preserving its P-positions
Journal of Combinatorial Theory Series A
Hi-index | 0.00 |
We consider extensions and restrictions of Wythoff's game having exactly the same set of P positions as the original game. No strict subset of rules gives the same set of P positions. On the other hand, we characterize all moves that can be adjoined while preserving the original set of P positions. Testing if a move belongs to such an extended set of rules is shown to be doable in polynomial time. Many arguments rely on the infinite Fibonacci word, automatic sequences and the corresponding numeration system. With these tools, we provide new two-dimensional morphisms generating an infinite picture encoding respectively P positions of Wythoff's game and moves that can be adjoined.