
TL;DR
This paper analyzes a generalization of Wythoff Nim called (1,2)-GDWN, demonstrating how added move options split the P-position beam and establishing density bounds for P-positions using complementary sequences.
Contribution
It proves that (1,2)-GDWN splits the P-position beam of Wythoff Nim and provides density bounds for P-positions based on properties of complementary sequences.
Findings
Existence of an infinite sector with only N-positions.
Infinitely many P-positions outside the sector.
Lower bound on the density of P-positions related to the golden ratio.
Abstract
We study impartial take away games on 2 unordered piles of finite nonnegative numbers of tokens . Two players alternate in removing at least one and at most all tokens from the respective piles, according to certain rules, and the game terminates when a player in turn is unable to move. We follow the normal play convention, which means that a player who cannot move loses. In the game of Wythoff Nim, a player is allowed to remove either any number of tokens from precisely one of the piles or the same number of tokens from both. Let and for all nonnegative integers , and . The P-positions of Wythoff Nim are all pairs of piles with and tokens respectively. We study a generalization of this game called where, in addition to the rules of Wythoff Nim, a player has the choice to remove a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Coding theory and cryptography
