Heap Games, Numeration Systems and Sequences
نویسنده
چکیده
We propose and analyse a 2-parameter family of 2-player games on two heaps of tokens, and present a strategy based on a class of sequences. The strategy looks easy, but is actually hard. A class of exotic numeration systems is then used, which enables us to decide whether the family has an efficient strategy or not. We introduce yet another class of sequences, and demonstrate its equivalence with the class of sequences defined for the strategy of our games.
منابع مشابه
Arrays, Numeration Systems and Games
We deene an innnite array A of nonnegative integers based on a linear recurrence, which produces basis elements of an exotic ternary numeration system. Using the numeration system we explore many properties of A. Further, we propose and analyze a family of 2-player games on a variable number of heaps of tokens, and present a winning strategy based on certain subarrays of A. Though the strategy ...
متن کاملArrays, numeration systems and Frankenstein games
We deene an innnite array A of nonnegative integers based on a linear recurrence, whose second row provides basis elements of an exotic ternary numeration system. Using the numeration system we explore many properties of A. Further, we propose and analyze a family Frankenstein of 2-player pebbling games played on a semi-innnite strip, and present a winning strategy based on certain subarrays of...
متن کاملAviezri Fraenkel and Combinatorial Games
The subject of combinatorial games has, like combinatorics itself, been slow to find recognition with the mathematical establishment. Combinatorics is now on sure ground, and combinatorial games is well on its way. This is in no small part due to the energy, enthusiasm and insight of Aviezri Fraenkel, who has linked combinatorial games with much else in mathematics — graph theory [24], error-co...
متن کاملCombinatorics, Automata and Number Theory
numeration systems The motivation for the introduction of abstract numeration systems stemsfrom the celebrated theorem of Cobham dating back to 1969 about the so-called recognisable sets of integers in any integer base numeration system.An abstract numeration system is simply an infinite genealogically ordered(regular) language. In particular, this notion extends the usual integ...
متن کاملUnbounded Iterations of Floor Functions and the Flora Game
Partition the set of games into subsets CompGames and PrimGames, precipitating a new 4-pile take-away game Flora. Let φ = (1 + √ 5)/2 denote the golden section. We investigate relationships between unbounded iterations of the floor function applied to various combinations of φ and φ. We use them to formulate an algebraic polynomial-time winning strategy for Flora, and also present recursive, ar...
متن کامل