Problem solving with anti TRIZ principles

G. L. Filkovsky, TRIZ Master,
New York, USA

Consider the following game:

Two players in turn place round chips on a round table. The chips are identical and there is unlimited amount of them. Each player places a chip anywhere on the table with only restriction being, the chip should not touch other chips on the table. A player who places the last chip, i.e. no room for more chips left, wins.

Who has a winning strategy in this game and what a winning strategy is?

A hint: knowledge of the 40 TRIZ principles could help to solve the problem, since a key to the solution is just contrary to one of them.