3 citations · 3 across the 1 of their papers we have counts for
1 paper
V. Gurvich, D. Martynov, V. Maximchuk +1
Given integer n and k such that 0<k≤n and n piles of stones, two player alternate turns. By one move it is allowed to choose any k piles and remove exactly one sto…