NIM with Cash

William Gasarch, John Purtilo, Douglas Ulrich

Let A be a finite subset of $\nat$. Then NIM(A;n) is the following 2-player game: initially there are $n$ stones on the board and the players alternate removing $a\in A$ stones. Th…