A restricted version of Wythoff's game (Q648398)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A restricted version of Wythoff's game |
scientific article; zbMATH DE number 5976485
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A restricted version of Wythoff's game |
scientific article; zbMATH DE number 5976485 |
Statements
A restricted version of Wythoff's game (English)
0 references
22 November 2011
0 references
Summary: \textit{E. Duchêne} and \textit{S. Gravier} [Discrete Math. 309, No. 11, 3595--3608 (2009; Zbl 1165.91007)] 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.
0 references
0.8745272159576416
0 references
0.8606629371643066
0 references
0.8551390171051025
0 references
0.835810124874115
0 references
0.8341695070266724
0 references
