i-\textsc{Mark}: a new subtraction division game

From MaRDI portal
Publication:265084



Abstract: Given two finite sets of integers SsubseteqNNNsetminus0 and DsubseteqNNNsetminus0,1,the impartial combinatorial game IMARK(S,D) is played on a heap of tokens. From a heap of n tokens, each player can moveeither to a heap of n−s tokens for some sinS, or to a heap of n/d tokensfor some dinD if d divides n.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 n tokensto a heap of lfloorn/dfloor tokens for any dinD.Under normal convention, it is observed that the Sprague-Grundy sequence of the game IMARK(S,D) is aperiodic for any sets S and D.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 n tokens can be computed in time O(logn).We also prove that, under mis`ere convention, the outcome sequence of these games is purely periodic.






Describes a project that uses

Uses Software






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)