# Rook-Chessboard problem. 6 rooks on 8 by 8 board

• m1sanch
In summary, there are ((8 choose 2) * (6 choose 4)) * 8! / 2 possible ways to place two red and four blue rooks on an 8-by-8 chessboard so that no two rooks can attack one another. This is equivalent to (8!/4!2!2!)^2 * 4! * 2!.
m1sanch

## Homework Statement

How many ways can two red and four blue rooks be placed on an 8-by-8 chessboard so that no two rooks can attack one another.

## Homework Equations

1)Number of permutations with two types=(n choose n1)=n!/((n1!)(n-n11))
2)Number of ways to place n rooks which have k object types(colors) on n-by-n board=(n!)2/((n1!)(n2!)...(nk!))

## The Attempt at a Solution

With the two equations on top I thought that they answer would be (8 choose 6)((8 choose 6) choose 2)) since it will be a 6 rooks on an 8-by-8 board.

*(8 choose 6)=(8!)/(6!((8-6)!)=8x7/2=28
This will simply to:
28(28!/(2!(28-2)!)=
28(28x27/2)=
14x28x27=28x27x14.

Did I do this correct or am I wrong in my reasoning.

P.S. I am sorry for the format. I am new to this site and tried to make it as clean as possible.

I don't see what you're doing here.
The answer should be a lot bigger however.

It's possible to choose the both the columns and the rows that will have blue and red rooks independently.
The number of ways to choose the colums is the number of ways of ordering (b,b,b,b,r,r,e,e) (e=empty).
Same for the rows.
No matter which columns and rows you choose you will end up with a 4x4 square of possible locations for the blue rooks and a 2x2 square of possible locations for the red rooks.

Ok so I can regard my multiset of "rooks" as being a set m={4*b,2*r,2*e} like you stated and use this theorem in my book that states:

For n rooks of k colors the number or arrangements is equal to

n!(n!/(the repetition number of each object)!).

So the number of arrangements would be (8!)2/(4!*2!*2!).

Which equals 10*7*6*8! Since 8!/(4!*4)=10*7*6.

You could just count directly.

With 6 non-attacking rooks on an 8x8 board, there will be exactly two rows and two columns that are free of rooks. Choose the two rows, there are (8 choose 2) ways to do so. Now choose the rows for your 4 blue rooks, there are (6 choose 4) ways to do so. At this point the rows of the remaining two rooks has already been determined by your choices. Now think of your six rooks and two empty places for a total of 8 objects. Take any of the 8! permutations of these and throw them in columns that way to get a non-attacking position. Thus the number of possible positions is:

((8 choose 2)*(6 choose 4))*8!​

Last edited:
Oh ok thank you for the other alternative to look at this problem. It does make sense now.

kduna said:
You could just count directly.

With 6 non-attacking rooks on an 8x8 board, there will be exactly two rows and two columns that are free of rooks. Choose the two rows, there are (8 choose 2) ways to do so. Now choose the rows for your 4 blue rooks, there are (6 choose 4) ways to do so. At this point the rows of the remaining two rooks has already been determined by your choices. Now think of your six rooks and two empty places for a total of 8 objects. Take any of the 8! permutations of these and throw them in columns that way to get a non-attacking position. Thus the number of possible positions is:

((8 choose 2)*(6 choose 4))*8!​

A factor of 2 too many. When choosing the columns, the two blank rows are interchangeable.

m1sanch said:
Ok so I can regard my multiset of "rooks" as being a set m={4*b,2*r,2*e} like you stated and use this theorem in my book that states:

For n rooks of k colors the number or arrangements is equal to

n!(n!/(the repetition number of each object)!).

So the number of arrangements would be (8!)2/(4!*2!*2!).

Which equals 10*7*6*8! Since 8!/(4!*4)=10*7*6.

8! <> 10 so the arithmetic here is wrong. (8!)2/(4!*2!*2!) is a factor of 2 too high.

You'd have 8!/(4!2!2!) arrangements for the rows, and the same number for the columns, and than 4! ways to order the blue and 2! ways to order the red rooks, which ends up being equal to
(8!/4! 2! 2!)^2 * 4! * 2! which is equal to ((8 choose 2) (6 choose 4) * 8!) / 2 as has been given by kduna and haruspex.

## What is the Rook-Chessboard problem?

The Rook-Chessboard problem is a mathematical puzzle where the objective is to place 6 rooks on an 8 by 8 chessboard in such a way that no two rooks can attack each other.

## What is a rook?

A rook is a chess piece that can move horizontally or vertically any number of spaces on a chessboard. It is considered a powerful piece as it can control many squares on the board.

## How many possible solutions are there for the Rook-Chessboard problem?

There are 4,426,165,368 possible solutions for the Rook-Chessboard problem. This number is calculated by using the formula n^m, where n is the number of possible positions for the first rook (64) and m is the number of remaining rooks (5).

## What is the minimum number of rooks needed to solve the Rook-Chessboard problem on an 8 by 8 board?

The minimum number of rooks needed to solve the Rook-Chessboard problem on an 8 by 8 board is 4. This means that it is possible to place 4 rooks on the board in such a way that they do not attack each other.

## What other variations of the Rook-Chessboard problem exist?

Other variations of the Rook-Chessboard problem include using a different sized board (such as a 7 by 7 or 10 by 10), using a different number of rooks, and adding other pieces to the board (such as knights or bishops). Each variation presents its own unique challenges and solutions.

Replies
8
Views
2K
Replies
10
Views
4K
Replies
7
Views
1K
Replies
1
Views
1K
Replies
17
Views
3K
Replies
8
Views
14K
Replies
2
Views
2K
Replies
3
Views
1K
Replies
20
Views
5K
Replies
5
Views
1K