A board of 2n x 2n is colored chess style, a movement is the changing of colors of a 2 x 2 square. For what integers n is possible to complete the board with one color using a finite number of movements? invariantalgorithmrotationcombinatorics unsolvedcombinatorics