2015/08/27 by Tanya Khovanova, Khovanova, Tanya, Karan Sarkar +1
Computer Science · Psychology · Social Sciences · #91A46 #Artificial Intelligence in Games #Combinatorics (math.CO) #Digital Games and Media #FOS: Mathematics #Gambling Behavior and Treatments
paper · pdf · doi:10.48550/arxiv.1508.07054
openalex publication_date 2015/08/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, we consider a modular extension to the game of Nim, which we call m-Modular Nim, and explore its optimal strategy. In m-Modular Nim, a player can either make a standard Nim move or remove a multiple of m tokens in total. We develop a winning strategy for all m with 2 heaps and for odd m with any number of heaps.