A pile has n stones. On each turn a player removes between 1 and m stones (inclusive). The player who takes…

Question

A pile has n stones. On each turn a player removes between 1 and m stones (inclusive). The player who takes the last stone WINS. Both play optimally and player one moves first. Return True if player one can force a win, else False. 0 <= n <= 10^9, 1 <= m <= 100. With n==0 there are no stones so player one cannot move and loses (return False).

Prep Room · Answer

### Intuition This problem models a classic combinatorial game similar to Nim, often called Bachet's game. In this game, a player can pick between 1 and `m`…

Nim game winning position