the game is structured like this:
- two players
- the players alternate moves
- 4 heaps $h_1,h_2,h_3,h_4$ with sizes $n_1,n_2,n_3,n_4$
- at each move, the player can either remove one or two elements from any of the heaps (meaning that if the player takes two elements, those two can either be from the same heap or from two different heaps, as long as the total number of removed elements per turn is 2).
- the game stops when the player (who loses the game) is left with 3 heaps of size $0$ and one heap with size greater than $0$.
Can anyone suggest a winning strategy for this game?