How many ways are there to place Queens on a chessboard so 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.
Let Q n be the number of ways of placing two non-attacking queens on an n × n board. We know that Q 1 = Q 2 = 0 . Suppose now that n ≥ 3 .
Thus Q n = Q n − 1 + ( 2 n − 1 ) ( n 2 − 3 ( n − 1 ) − 1 ) − ( n − 1 ) ( n − 2 ) = Q n − 1 + 2 n 3 − 8 n 2 + 1 0 n − 4 n ≥ 3 and hence Q N = n = 3 ∑ N ( 2 n 3 − 8 n 2 + 1 0 n − 4 ) = 6 1 N ( N − 1 ) ( N − 2 ) ( 3 N − 1 )