How many ways are there to place one white queen and one black queen on an empty chessboard such that they do not attack each other?
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.
On any square the white queen is placed on, the black queen cannot be placed on the same rank or file. This leaves 6 4 − 8 − 7 = 4 9 squares for the black queen to be placed.
However, we must also subtract the number of diagonal squares the white queen is attacking.
There are 2 such diagonals, from bottom left to top right or from top left to bottom right. They are symmetric, so we only have to consider one case and then multiply by 2. WLOG let us consider the bottom left to top right case.
When the white queen is on the A7-B8 diagonal, she attacks 1 square but there are 2 possible squares for her own placement. Thus we subtract 1 ∗ 2 .
Doing this process over all 13 such diagonals, we get 1 ∗ 2 + 2 ∗ 3 + … + 6 ∗ 7 + 7 ∗ 8 + 6 ∗ 7 + 5 ∗ 6 + … + 1 ∗ 2 = 2 n = 1 ∑ 6 n ( n + 1 ) + 7 ∗ 8 2 ( 6 6 ∗ 7 ∗ 1 3 + 2 6 ∗ 7 ) + 5 6 = 2 8 0
Multiplying by 2 for the other type of diagonal and subtracting this from our previous total number of squares, 6 4 ∗ 4 9 − 2 ∗ 2 8 0 = 2 5 7 6