A Generalization of Wythoff's Game

نویسندگان

  • Aviezri S. Fraenkel
  • I. Borosh
چکیده

Wythoff s game is a variation of Nim, a two-pile game in which each player removes counters in turn until the winner takes the last counter. The safe-pairs generated in the solution of Wythoff's game have many properties interesting in themselves, and are related to the canonical Zeckendorf representation of an integer using Fibonacci numbers. In Nim, the strategy is related to expressing the numbers in each pile in binary notation, or representing them by powers of 2. Here, the generalized game provides number sequences related to the canonical Zeckendorf representation of integers using Lucas numbers.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

General Restriction of (s, t)-Wythoff's Game

A.S. Fraenkel introduced a new (s, t)-Wythoff’s game which is a generalization of both Wythoff’s game and a-Wythoff’s game. Four new models of a restricted version of (s, t)-Wythoff’s game, Odd-Odd (s, t)-Wythoff’s Game, Even-Even (s, t)Wythoff’s Game, Odd-Even (s, t)-Wythoff’s Game and Even-Odd (s, t)-Wythoff’s Game, are investigated. Under normal or misère play convention, all P -positions of...

متن کامل

Wythoff's sequence and N-Heap Wythoff's conjectures

Define a Wythoff’s sequence as a sequence of pairs of integers {(An, Bn)}n>n0 such that there exists a finite set of integers T , An = mex({Ai, Bi : i < n}∪T ), Bn−An = n, and {Bn} ∩ T = ∅. Structural properties and behaviors of Wythoff’s sequence are investigated. The main result is that for such a sequence, there always exists an integer α such that when n is large enough, |An − bnφc − α| ≤ 1...

متن کامل

A Restricted Version of Wythoff's Game

E. Duchêne and S. Gravier present the following open problem: In Wythoff’s game, each player can either remove at most R tokens from a single heap (i.e. there is an upper bound R on the number of removing tokens), or remove the same number of tokens from both heaps but there is no upper bound on the number of removing tokens. This open problem is investigated and all its P-positions are given.

متن کامل

Extensions and restrictions of Wythoff's game preserving its p positions

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 give 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 tim...

متن کامل

Adjoining to Wythoff's Game its P-Positions as Moves

A rewarding method for generating a new game ? i+1 from a known game ? i is to adjoin an appropriate subset of the P-positions (2nd player winning positions) of ? i to ? i+1 as moves. We illustrate this statement by adjoining to the generalized Wythoo Game three subsets of its P-positions as moves, resulting in three diierent classes of games. We analyze these classes, characterizing the P-posi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comb. Theory, Ser. A

دوره 15  شماره 

صفحات  -

تاریخ انتشار 1973