How to maximize chances to win? Let's say I have $n$ stacks of coins such as the $i$-th stack contains $c_i$ coins at the beginning of a game. The game is simple. The players have to take any number of coins from one stack (and only one) during their turn. The person taking the last coin loses the game. Is there a good strategy to win or is the game too prone to randomness ?

This is the misère version of Nim; it is **very** well studied, and the winning strategies for both the regular and the misère versions are described (and their correctness proved) in the linked article.