Exactly like this but larger:
(http://images.kaneva.com/filestore4/3492062/4087484/checkerboard.gif)
JExactly like this but larger:
(http://images.kaneva.com/filestore4/3492062/4087484/checkerboard.gif)
Then the solution is mtiply the NxN then devide by two since it is either white or red. My thoughts only though. I am by no means a math guy.
Exactly like this but larger:
(http://images.kaneva.com/filestore4/3492062/4087484/checkerboard.gif)
each of the 1x1 squares [...] shares a side with at most one red square
Your white squares share sides with four red squares, which is too much.
I believe the maximum is a pattern like this one:
(http://s1.directupload.net/images/120729/tst3d9n8.png)
Which means you have 400 red squares in total (in every second line every second square is red: 40*40 / 4 = 400).