1xn table
Source: Bosnia 2009., problem 4.
August 6, 2011
inductioncombinatorics unsolvedcombinatoricsGame TheoryBosnia2009
Problem Statement
Given an x table (), two players alternate the moves in which they write the signs + and - in the cells of the table. The first player always writes +, while the second always writes -. It is not allowed for two equal signs to appear in the adjacent cells. The player who can’t make a move loses the game. Which of the players has a winning strategy?