MathDB
Who has a winning strategy? - [UKRMO 2009 Grade 10]

Source:

January 23, 2011
combinatorics unsolvedcombinatorics

Problem Statement

Given a n×nn \times n square board. Two players by turn remove some side of unit square if this side is not a bound of n×nn \times n square board. The player lose if after his move n×nn \times n square board became broken into two parts. Who has a winning strategy?
Back to ProblemsView on AoPS