Dimitri places 50 Rooks on a chessboard in such a way that there's no two Rooks that attack each other. How many squares are under attack?
Note : A Rook does not attack the square on which it is.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
In general, for a m × n chessboard, with m ≤ n , and k Rooks, with k ≤ m , as each Rook attacks m + n − 2 squares (its whole column and row, and we're counting twice the square on which it is stood) and two Rooks attack the same 2 squares (the intersection of the rows and columns they're attacking), the number of squares under attack is given by the following expression:
k ( m + n − 2 ) − 2 ( k 2 )
In the particular case m = n = 1 0 0 and k = 5 0 , the number of squares under attack is 5 0 ( 1 0 0 + 1 0 0 − 2 ) − 2 ( 5 0 2 ) = 5 0 ⋅ 1 9 8 − 5 0 ⋅ 4 9 = 7 4 5 0 .