Problem

Source:

Tags: combinatorics unsolved, combinatorics



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