Who got hit?

How many ways are there to place 2 2 Queens on a n × n n\times n chessboard so that they do not attack each other ?

( n 1 ) + ( n 2 ) + ( 3 n 1 ) 2 ! \frac{(n-1)+(n-2)+(3n-1)}{2!} n ! 2 ( n 1 ) ( n 2 ) ( 3 n 1 ) \frac{n!}{2}(n-1)(n-2)(3n-1) n 6 ( n 1 ) ( n 2 ) ( 3 n 1 ) \frac{n}{6}(n-1)(n-2)(3n-1) n 2 ! ( n 1 ) ( n 2 ) ( 3 n 1 ) \frac{n}{2!}(n-1)(n-2)(3n-1)

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.

1 solution

Mark Hennings
Oct 21, 2018

Let Q n Q_n be the number of ways of placing two non-attacking queens on an n × n n \times n board. We know that Q 1 = Q 2 = 0 Q_1 = Q_2 = 0 . Suppose now that n 3 n \ge 3 .

  • There are Q n 1 Q_{n-1} ways of placing two non-attacking queens on an n × n n \times n board so that no queen is in either the last row or column,
  • There are 2 n 1 2n-1 squares in either the last row or column, and any queen on one of those squares attacks a total of 3 ( n 1 ) 3(n-1) other squares,
  • There are ( n 1 ) ( n 2 ) (n-1)(n-2) ways of placing two non-attacking queens, so that each is in either the last row or column.

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 + 10 n 4 n 3 Q_n \; = \; Q_{n-1} + (2n-1)\big(n^2 - 3(n-1) - 1\big) - (n-1)(n-2) \; = \; Q_{n-1} + 2n^3 - 8n^2 + 10n - 4 \hspace{2cm} n \ge 3 and hence Q N = n = 3 N ( 2 n 3 8 n 2 + 10 n 4 ) = 1 6 N ( N 1 ) ( N 2 ) ( 3 N 1 ) Q_N \; = \; \sum_{n=3}^N(2n^3 - 8n^2 + 10n - 4) \; = \; \boxed{\tfrac16N(N-1)(N-2)(3N-1)}

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...