Dynamic One-Pile Nim
Arthur Holshouser, Harold Reiter, James Rudzinski · The Fibonacci Quarterly · 2003
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