Register to reply

Probability and chess

by fk378
Tags: chess, probability
Share this thread:
fk378
#1
Jul3-09, 07:49 PM
P: 367
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?
Phys.Org News Partner Science news on Phys.org
World's largest solar boat on Greek prehistoric mission
Google searches hold key to future market crashes
Mineral magic? Common mineral capable of making and breaking bonds
g_edgar
#2
Jul3-09, 08:04 PM
P: 607
How many different ways to put the rooks on the board without the no-capture restriction? How many ways with the restriction?
fk378
#3
Jul3-09, 08:08 PM
P: 367
no-capture restriction: 8! ways
without the restriction: 56! ways

benorin
#4
Jul3-09, 08:15 PM
HW Helper
P: 1,025
Probability and chess

Not to give it away, but so you can check: P(no capture) [tex]\approx .911\times 10^{-5}[/tex].
fk378
#5
Jul3-09, 08:16 PM
P: 367
I don't understand how that is? Can you explain?
Dick
#6
Jul3-09, 10:24 PM
Sci Advisor
HW Helper
Thanks
P: 25,246
Can you start by explaining why you think 56! is the number of ways to place them without restriction? That is certainly wrong.
Dunkle
#7
Jul6-09, 11:22 PM
P: 56
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.
Дьявол
#8
Jul7-09, 07:05 AM
P: 365


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 * ???
epenguin
#9
Jul12-09, 02:21 PM
HW Helper
epenguin's Avatar
P: 1,965
Quote Quote by fk378 View Post
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.
The first sentence is not equivalent to the second.
Dick
#10
Jul12-09, 10:45 PM
Sci Advisor
HW Helper
Thanks
P: 25,246
Quote Quote by epenguin View Post
The first sentence is not equivalent to the second.
Why not?
epenguin
#11
Jul13-09, 08:50 AM
HW Helper
epenguin's Avatar
P: 1,965
Because capture possibility depends on the colour of the rooks.


Register to reply

Related Discussions
Physics Forums Chess Forum Feedback & Announcements 17
Ethod or algorithm that will always win in chess Set Theory, Logic, Probability, Statistics 2
Valid chess board configuration General Discussion 33
Probability of Pairings in Chess Game Calculus & Beyond Homework 3
Does anyone want to play a game of chess? General Discussion 0