Blocking Wythoff Nim

From MaRDI portal
Publication:540132

zbMATH Open1217.91024arXiv1010.5816MaRDI QIDQ540132FDOQ540132


Authors: Urban Larsson Edit this on Wikidata


Publication date: 1 June 2011

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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, k1ge0, 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 k=2 and k=3 and, supported by computer simulations, state conjectures of the asymptotic `behavior' of the P-positions for the respective games when 4lekle20.


Full work available at URL: https://arxiv.org/abs/1010.5816

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations





Cited In (13)





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)