Note : the mechanisms described in this puzzle are related to those found in this question.
This is a game of 2 players.
Each player can pick up 1, 2, or 3 coins in any pile (copper , silver , gold) in their turn. The winning condition for a player is to pick up the last gold coin.
However, it is forbidden to empty a pile if there are non-empty piles of less valued coins.
(can't empty the gold pile if the silver pile is still non-empty)
At the start of the game, the initial number of coins on each pile is set as a random strictly positive number.
For each game, you have the undeniable advantage of deciding who goes first, between you and your opponent. Beware, he knows already all the tricks and will play perfectly.
Question : How can you win, given any possible combination, in the initial state ?
Example of a game :
[C1 | S4 | G1] you decide to go first (S : -2) [C1 | S2 | G1] he has 2 possibilities : (C : -1) or (S : -1) [C0 | S2 | G1] or [C1 | S1 | G1] you respond adequally to make [0 1 1] [C0 | S1 | G1] his turn (S: -1) [C0 | S0 | G1] (G : -1) -> you win
Source : A stone minigame found in the video game Tales of Eternia (PSP).
The title "Master of stones" is actually granted to any player who can win this mini game.
Here, stones have been replaced by coins for differentiating the orders of the piles and the extra rule about non empty piles.