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.
A.S. Fraenkel introduces a new ( , )-Wythoff's game which is the generalization of both -Wythoff's game and Wythoff's game. Fraenkel determines all -positions of ( , )-Wythoff's game under normal play convention. In this paper, the ( , )-Wythoff's game under the misère play convention is investigated. Both the set of all -positions and optimal strategies are given. Our results also provide answers toWythoff's game and Wythoff's game under the misère play convention.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.