On remoteness functions of k-NIM with k+1 piles in normal and in misère versions

Vladimir Gurvich, Vladislav Maximchuk, Georgy Miheenkov +1

Given integer $n$ and $k$ such that $0<k\le n$ and $n$ piles of stones, two players alternate turns. By one move it is allowed to choose any $k$ piles and remove exactly one st…