transparent gif

 

Ej inloggad.

Göteborgs universitets publikationer

Blocking Wythoff Nim

Författare och institution:
Urban Larsson (Institutionen för matematiska vetenskaper, matematik, Chalmers/GU)
Publicerad i:
The Electronic Journal of Combinatorics, 18 ( 1 ) s. 18
ISSN:
1077-8926
Publikationstyp:
Artikel, refereegranskad vetenskaplig
Publiceringsår:
2011
Språk:
engelska
Fulltextlänk:
Sammanfattning (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, k − 1 ≥ 0, 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 ‘sets of aggregation points’ for the P-positions whenever 4 ≤ k ≤ 20. Certain comply variations of impartial games are also discussed.
Ämne (baseras på Högskoleverkets indelning av forskningsämnen):
NATURVETENSKAP ->
Matematik ->
Diskret matematik
Nyckelord:
Beatty sequence, Blocking maneuver, Exact $k$-cover, Impartial game, Muller Twist, Wythoff Nim
Postens nummer:
141238
Ingår i post nr:
Posten skapad:
2011-05-30 22:20
Posten ändrad:
2016-08-22 09:01

Visa i Endnote-format

Göteborgs universitet • Tel. 031-786 0000
© Göteborgs universitet 2007