##
**Dynamic one-pile Nim.**
*(English)*
Zbl 1093.91013

From the introduction: The purpose of this paper is to solve a class of combinatorial games consisting of one-pile counter pickup games for which the maximum number of counters that can be removed on each successive move changes during the play of the game. Two players alternate removing a positive number of counters from the pile. An ordered pair \((N,x)\) of positive integers is called a position. The number \(N\) represents the size of the pile of counters and \(x\) represents the greatest number of counters that can be removed on the next move. A function \(f: \mathbb Z^+\to \mathbb Z^+\) is given which determines the maximum size of the next move in terms of the current move size. Thus a move in a game is an ordered pair of positions \((N,x)\mapsto(N-k,f(k))\), where \(1\leq k\leq\min\{N,x\}\). The game ends when there are no counters left, and the winner is the last player to move in the game. This paper extends two papers, one by R. J. Epp and T. S. Ferguson [Fibonacci Q. 18, 300–303 (1980; Zbl 0444.90112)], and the other by A. J. Schwenk [“Take-away games”. Fibonacci Q. 8, 225–234, 241 (1970; Zbl 0213.46402)].