A Restricted Version of Wythoff's Game

  • Wen An Liu
  • Haifeng Li
  • Bei Li
DOI: https://doi.org/10.37236/694

Abstract

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.

Published
2011-10-24
How to Cite
Liu, W. A., Li, H., & Li, B. (2011). A Restricted Version of Wythoff’s Game. The Electronic Journal of Combinatorics, 18(1), P207. https://doi.org/10.37236/694
Issue
Volume 18, Issue 1 (2011)
Article Number
P207