科研之友
微信
新浪微博
Facebook
分享链接
摘要
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.
- 出版日期2011-10-24
- 单位河南师范大学
