Question 5
Let a square scheme $2n \times 2n$, made of unit white squares be given. Allowed move is to change the color of three consecutive unit squares in a particular row or three consecutive unit squares in a particular column - unit square with white color goes to unit square with black color and vice versa.
Find all nonnegative integers, $n \ge 2$, for which with allowed moves the given square scheme can be colored like chess table.
Find all nonnegative integers, $n \ge 2$, for which with allowed moves the given square scheme can be colored like chess table.