Currently displaying 1 – 5 of 5

Showing per page

Order by Relevance | Title | Year of publication

A morphic approach to combinatorial games : the Tribonacci case

Eric DuchêneMichel Rigo — 2008

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

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.

A morphic approach to combinatorial games: the Tribonacci case

Eric DuchêneMichel Rigo — 2007

RAIRO - Theoretical Informatics and Applications

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.

New results about impartial solitaire clobber

Eric DuchêneSylvain GravierJulien Moncel — 2009

RAIRO - Operations Research

Impartial Solitaire Clobber is a one-player version of the combinatorial game Clobber, introduced by Albert  in 2002. The initial configuration of Impartial Solitaire Clobber is a graph, such that there is a stone placed on each of its vertex, each stone being black or white. A move of the game consists in picking a stone, and clobbering an adjacent stone of the opposite color. By clobbering we mean that the clobbered stone is removed from the graph, and replaced by the clobbering one. The aim...

Page 1

Download Results (CSV)