**The Stone Game**(

**Problem 260**(View Problem)) is played with three piles of stones and two players, where the winning strategy is to take the last stone(s) from the board.

- • The board has three piles of stones;

• At each player's turn, the player removes one or more stones from from one or more piles;

• If the player takes stones from more than one pile, the player must remove the same number of stones from each of the selected piles;

• The player taking the last stone(s) wins the game.

- • N stones from any single pile; or

• N stones from each of any two piles (2N total); or

• N stones from each of the three piles (3N total).

Project Euler gives the following as examples of losing configurations:

(0,1,2) and (1,3,3)

I do not have an issue with the first of these losing configuration examples, as I understand that (0,0,2), (0,1,1) and (0,1,0) would be winning cofigurations, allowing the next player to remove all of the ramaining stones, but I cannot see how (1,3,3) is considered a loosing configuration, where regardless of the legal move taken by the next player, that player's opponent can immeditely win (as is implied by the problem statement) ... by selecting one stone from pile as clearly (1,2,3), (1,1,3), and (1,2,2) could be the left after this next turn, none of which allow for an immediate win.