i-\textsc{Mark}: a new subtraction division game
From MaRDI portal
Publication:265084
Abstract: Given two finite sets of integers and ,the impartial combinatorial game is played on a heap of tokens. From a heap of tokens, each player can moveeither to a heap of tokens for some , or to a heap of tokensfor some if divides .Such games can be considered as an integral variant of MARK-type games, introduced by Elwyn Berlekamp and Joe Buhlerand studied by Aviezri Fraenkel and Alan Guo, for which it is allowed to move from a heap of tokensto a heap of tokens for any .Under normal convention, it is observed that the Sprague-Grundy sequence of the game is aperiodic for any sets and .However, we prove that, in many cases, this sequence is almost periodic and that the set of winning positions is periodic.Moreover, in all these cases, the Sprague-Grundy value of a heap of tokens can be computed in time .We also prove that, under mis`ere convention, the outcome sequence of these games is purely periodic.
Recommendations
Cites work
- Aperiodic subtraction games
- Combinatorial game theory
- scientific article; zbMATH DE number 5145315 (Why is no real title available?)
- The On-Line Encyclopedia of Integer Sequences
- The vile, dopey, evil and odious game players
- Winning strategies for aperiodic subtraction games
- Winning ways for your mathematical plays. Vol. 1.
Cited in
(3)
This page was built for publication: \(i\)-\textsc{Mark}: a new subtraction division game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q265084)