Dynamic single-pile Nim using multiple bases (Q819926)

Two players alternate removing positive numbers of counters from a single pile and the winner is the player who removes the last counter. On the first move, at most \(k\) counters can be removed, where \(k\) is a parameter. Then a player can remove a maximum of \(f(n,x)\) counters where: \(x\) is the number of counters removed by his opponent on the preceding move, and \(n\) is the pile size before the last move of his opponent. The game is solved when the function \(f: \mathbb{N} \times \mathbb{N} \rightarrow \mathbb{N}\) satisfies: \(\exists t, \forall n,x, \; f(n+t,x)=f(n,x).\) The solutions use multiple bases, which may be quite hard to generate.