Alan Guo
Published 2011-08-05, updated 2011-08-09Version 2
We provide a winning strategy for sums of games of MARK-t, an impartial game played on the nonnegative integers where each move consists of subtraction by an integer between 1 and t-1 inclusive, or division by t, rounding down when necessary. Our algorithm computes the Sprague-Grundy values for arbitrary n in quadratic time. This solves a problem posed by Aviezri Fraenkel. In addition, we characterize the P-positions and N-positions for the game in mis\`ere play.
Comments: 6 pages, no figuress, added references, fixed typos, made proofs more efficient
On Aperiodic Subtraction Games with Bounded Nim Sequence
A Winning Strategy for the Game of Antonim
Chomp on Kneser graphs and graphs with only one odd cycle
![QR code for arXiv:1108.1239 [math.CO]](http://oss.arxitics.com/images/favicon.svg)