Add to ORKGAbstract. We propose a variation of Wytho'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 corre-sponding exotic numeration system built on the Tribonacci sequence, deciding whether a game position is losing or not can be computed in polynomial time. 1
AbstractIn 1905 Bouton gave the complete theory of a two-player combinatorial game: the game of Nim....
Siegel suggests in his book on combinatorial games that quite simple games provide us with challengi...
Abstract. We analyze several perfect-information combinatorial games played on planar triangulations...
Abstract. We propose a variation of Wytho's game on three piles of tokens, in the sense that th...
We propose a variation of Wythoff's game on three piles of tokens, in the sense that the losing pos...
We propose a variation of Wythoff's game on three piles of tokens, in the sense that the losing posi...
16 pagesInternational audienceWe propose a variation of Wythoff's game on three piles of tokens, in ...
Abstract. Generalized Tribonacci morphisms are dened on a three letters alphabet and generate the so...
International audienceGeneralized Tribonacci morphisms are denoted on a three letters alphabet and g...
Generalized Tribonacci morphisms are de ned on a three letters alphabet and generate the so-called g...
Wythoff's game is a century old classical two players combinatorial game. When studying this game, B...
The general motivation behind this talk is to present some interplay between combinatorial game theo...
John Horton Conway\u27s combinatorial game theory was applied to a new partizan game with a complete...
Combinatorial games are finite games where players are aware of all plays at all times and there is ...
Combinatorial games are finite games where players are aware of all plays at all times and there is ...
AbstractIn 1905 Bouton gave the complete theory of a two-player combinatorial game: the game of Nim....
Siegel suggests in his book on combinatorial games that quite simple games provide us with challengi...
Abstract. We analyze several perfect-information combinatorial games played on planar triangulations...
Abstract. We propose a variation of Wytho's game on three piles of tokens, in the sense that th...
We propose a variation of Wythoff's game on three piles of tokens, in the sense that the losing pos...
We propose a variation of Wythoff's game on three piles of tokens, in the sense that the losing posi...
16 pagesInternational audienceWe propose a variation of Wythoff's game on three piles of tokens, in ...
Abstract. Generalized Tribonacci morphisms are dened on a three letters alphabet and generate the so...
International audienceGeneralized Tribonacci morphisms are denoted on a three letters alphabet and g...
Generalized Tribonacci morphisms are de ned on a three letters alphabet and generate the so-called g...
Wythoff's game is a century old classical two players combinatorial game. When studying this game, B...
The general motivation behind this talk is to present some interplay between combinatorial game theo...
John Horton Conway\u27s combinatorial game theory was applied to a new partizan game with a complete...
Combinatorial games are finite games where players are aware of all plays at all times and there is ...
Combinatorial games are finite games where players are aware of all plays at all times and there is ...
AbstractIn 1905 Bouton gave the complete theory of a two-player combinatorial game: the game of Nim....
Siegel suggests in his book on combinatorial games that quite simple games provide us with challengi...
Abstract. We analyze several perfect-information combinatorial games played on planar triangulations...