La Trobe
1154216_Gurvich,V_2020.pdf (464.97 kB)

Slow k-nim

Download (464.97 kB)
journal contribution
posted on 21.01.2021, 04:17 by V Gurvich, S Heubach, Nhan Ho, N Chikin
© 2020, Colgate University. All rights reserved. Given n piles of tokens and a positive integer k ≤ n, we study two impartial combinatorial games, Nim1n,≤kand Nim1n,=k. In the first (resp. second) game, each move consists of choosing at least 1 and at most k (resp. exactly k) non-empty piles and removing one token from each of them. We study the normal and misére versions of both games. For Nim1n,=k we give explicit formulas of its Sprague-Grundy function for the cases 2 = k ≤ n ≤ 4; for Nim1n,≤k we provide such formulas for 2 = k ≤ n ≤ 3 and characterize the P-positions for the cases n ≤ k + 2 and n = k + 3 ≤ 6.

History

Publication Date

13/04/2020

Journal

Integers

Volume

20

Article Number

G3

Pagination

19p.

Publisher

Integers

ISSN

1553-1732

Rights Statement

The Author reserves all moral rights over the deposited text and must be credited if any re-use occurs. Documents deposited in OPAL are the Open Access versions of outputs published elsewhere. Changes resulting from the publishing process may therefore not be reflected in this document. The final published version may be obtained via the publisher’s DOI. Please note that additional copyright and access restrictions may apply to the published version.

Licence

Exports

Journal Articles

Categories

Licence

Exports