Problem: We have two heaps of coins with 100 and 99 coins. Two players take some coins alternately, either at least one, at most 10, from the first one, or at least one, at most 9 from the second. The winner is who takes the last coin. How shall the game be played to win?
I think this is supposed to be solve using NIM strategy and Grundy numbers. Some hints on what general strategy to use on these problems would be nice. Also, an in-depth analysis of the problem would be helpful as a model that would allow me to approach other similar problems.