1. The problem statement, all variables and given/known data If 8 rooks (castles) are randomly places on a chessboard, compute the probability that none of the rooks can capture any of the others. That is, compute the probability that no row or file contains more than one rook. 3. The attempt at a solution I just started it by knowing there are 64 squares on a chessboard. If there are 8 rooks, then that leaves 56 empty blocks. Where to go from here?
How many different ways to put the rooks on the board without the no-capture restriction? How many ways with the restriction?
Can you start by explaining why you think 56! is the number of ways to place them without restriction? That is certainly wrong.
First, place a rook in a random spot on the board. How many ways are there to do this? Next, figure out how many places are left on the board where the second rook can't take the first rook. Now, how many ways are there to place another rook on the board so that it can't take either of the first two. Continue this until you get to the last rook (there should only be one space left for that one). Finally, figure out how many possible ways there are to place the 8 rooks on the board with no restrictions.
So you need one rook in one row. [tex]P(A)=\frac{m}{n}[/tex] 8th row - the rook can move on 8! ways Can you find the probability now? Notice: you got 8 rooks so n=8 * ???