Article (Scientific journals)
Invariant games
Duchêne, Eric; Rigo, Michel
2010In Theoretical Computer Science, 411, p. 3169-3180
Peer Reviewed verified by ORBi
 

Files


Full Text
absolute3.pdf
Author preprint (182.5 kB)
Request a copy

All documents in ORBi are protected by a user license.

Send to



Details



Keywords :
2-player removal game; Beatty sequences; Sturmian word
Abstract :
[en] In the context of 2-player removal games, we define the notion of invariant game for which each allowed move is independent of the position it is played from. We present a family of invariant games which are variations of Wythoff's game. The set of P-positions of these games are given by a pair of complementary Beatty sequences related to the irrational quadratic number $\alpha_k = (1; \overline{1, k})$. We also provide a recursive characterization of this set.
Disciplines :
Mathematics
Author, co-author :
Duchêne, Eric
Rigo, Michel  ;  Université de Liège - ULiège > Département de mathématique > Mathématiques discrètes
Language :
English
Title :
Invariant games
Publication date :
July 2010
Journal title :
Theoretical Computer Science
ISSN :
0304-3975
Publisher :
Elsevier Science, Amsterdam, Netherlands
Volume :
411
Pages :
3169-3180
Peer reviewed :
Peer Reviewed verified by ORBi
Available on ORBi :
since 12 May 2010

Statistics


Number of views
140 (31 by ULiège)
Number of downloads
10 (9 by ULiège)

Scopus citations®
 
22
Scopus citations®
without self-citations
15
OpenCitations
 
19

Bibliography


Similar publications



Contact ORBi