On a table there are 1999 counters, red on one side and black on the other side, arranged arbitrarily. Two people alternately make moves, where each move is of one of the following two types:
(1) Remove several counters which all have the same color up;
(2) Reverse several counters which all have the same color up.
The player who takes the last counter wins. Decide which of the two players (the one playing first or the other one) has a wining strategy. combinatoricsStrategygame