Abstract: The 2-player impartial game of Wythoff Nim is played on two piles of tokens. A move consists in removing any number of tokens from precisely one of the piles or the same number of tokens from both piles. The winner is the player who removes the last token. We study this game with a blocking maneuver, that is, for each move, before the next player moves the previous player may declare at most a predetermined number, , of the options as forbidden. When the next player has moved, any blocking maneuver is forgotten and does not have any further impact on the game. We resolve the winning strategy of this game for and and, supported by computer simulations, state conjectures of the asymptotic `behavior' of the -positions for the respective games when .
Recommendations
Cited in
(13)- Cold positions of the restricted Wythoff's game
- On tame, pet, domestic, and miserable impartial games
- 2-pile Nim with a restricted number of move-size imitations
- A cellular automaton for blocking queen games
- A cellular automaton for blocking queen games
- scientific article; zbMATH DE number 2119667 (Why is no real title available?)
- scientific article; zbMATH DE number 2124097 (Why is no real title available?)
- Subtraction games in more than one dimension
- Another form of matrix Nim
- \(a\)-Wythoff's game with \(n\) players
- Impartial games emulating one-dimensional cellular automata and undecidability
- scientific article; zbMATH DE number 2124099 (Why is no real title available?)
- Analyzing two-color Babylon
This page was built for publication: Blocking Wythoff Nim
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q540132)