(adsbygoogle = window.adsbygoogle || []).push({}); 1. The problem statement, all variables and given/known data

In how many ways can eight identical rooks be placed on an ordinary 8x8 chessboard so that no two are in the same row or column? In how many ways, if each rook has a different color?

2. Relevant equations

I looked at the equation n choose k (nck), but I dont know if that would work

3. The attempt at a solution

I know each time you place a rook that the number of spaces to put the next rook goes down to the next perfect square...

(Choice, Available Places to put rook)

(1,64)

(2,49)

(3,36)

(4,25)

(5,16)

(6,9)

(7,4)

(8,1)

I thought it might be 64*49*36*...*1, but that seems like that would be too large a number over 1.625 billion...my intuition says that is way too big.

Any hints, tips, suggestions, answers for this problem? Am I thinking about it the right way? Thanks

**Physics Forums - The Fusion of Science and Community**

# Placing 8 rooks onto a 8x8 chess board so no two share same row or column

Have something to add?

- Similar discussions for: Placing 8 rooks onto a 8x8 chess board so no two share same row or column

Loading...

**Physics Forums - The Fusion of Science and Community**