Name
Abstract | ||
|---|---|---|
E. Duchene 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. |
Year | Venue | Field |
|---|---|---|
2011 | ELECTRONIC JOURNAL OF COMBINATORICS | Discrete mathematics,Combinatorics,Open problem,Upper and lower bounds,Heap (data structure),Wythoff's game,Mathematics,Wythoff array |
DocType | Volume | Issue |
Journal | 18.0 | 1.0 |
ISSN | Citations | PageRank |
1077-8926 | 10 | 0.85 |
References | Authors | |
2 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wen An Liu | 1 | 65 | 12.61 |
| Haifeng Li | 2 | 25 | 7.92 |
| Bei Li | 3 | 10 | 0.85 |