Question 94
For a grid of $55 \times 55$ squares, let us consider the following operation:
Operation: Choose a rectangular region consisting of a number of squares from the grid, and color the region either white or black.
Determine the smallest possible number of operations necessary to reach from the initial configuration, in which all the squares are colored white to the configuration satisfying the following conditions:
* the square at the upper left corner is colored black.
* every square sharing a side with a black-colored square is colored white.
* every square sharing a side with a white-colored square is colored black.
Operation: Choose a rectangular region consisting of a number of squares from the grid, and color the region either white or black.
Determine the smallest possible number of operations necessary to reach from the initial configuration, in which all the squares are colored white to the configuration satisfying the following conditions:
* the square at the upper left corner is colored black.
* every square sharing a side with a black-colored square is colored white.
* every square sharing a side with a white-colored square is colored black.