Question
Question: Three squares of a chessboard being chosen at random, what is the chance that two are of one color a...
Three squares of a chessboard being chosen at random, what is the chance that two are of one color and one of another?
Solution
We find sample size n(S) by finding the number of ways we can get 3 squares out 64 if we randomly choose. We denote the event of getting two squares of one colour and one of another as A. We see that A can occur in two ways either we get 2 black squares and 1 white square n(2B,1W) and or we get 2 white squares and 1 black square n(2W,1B). We add the number of ways for both the cases to get the number of ways A can occur as n(A). The required probability is P(A)=n(S)n(A).$$$$
Complete step-by-step solution:
We know from definition of probability that if there is n(A) number of ways of event A occurring and n(S) is the size of the sample space then the probability of the event A occurring is given by
P(A)=n(S)n(A)
We are given the question of 3 squares of the chess board being chosen at random. We know that there are a total of 64 squares in the chess board out of which 32 are in black colour and 32 are in white colour. We can select 3 squares out of 64 squares in 64C3 ways which is the size of sample space. So we have
n(S)=64C3
We are asked in the question to find the chance or probability of two the selected squares are of one colour and one of another colour. Let us denote the event of getting two squares of one colour and one square of another colour as A. We see that A can occur in 2 two ways either we get 2 squares of black colour and 1 square of white colour (2B, 1 W) or we get 2 squares of white colour and 1 square of black colour (2W, 1B). $$$$
Case-1: We can get 2 squares of black colour out 32 in 32C2 ways and we can get the 1 square of white out of 32 in 32C1 ways. So by the rule of product the numbers of ways we can get outcomes for case-1 is,
n(2B,1W)=32C2×32C1
Case-2: We can get 2 squares of white colour out 32 in 32C2 ways and we can get the 1 square of black out of 32 in 32C1 ways. So by the rule of product the numbers of ways we can get outcomes for case-2 is,
n(2W,1B)=32C2×32C1
We use rule of sum and get the number of ways the event A can occur as
n(A)=n(2B,1W)+n(2W,1B)=32C2×32C1+32C2×32C1=2×32C2×32C1
So the probability that the event A can happen is
P(A)=n(S)n(A)=64C32×32C2×32C1=3×2×164×63×622×2×132×31×32=2116
The above probability is the required probability.
Note: We note that we could use combination because the positions of all squares in the chess board are distinct not identical and we have used the formula for combinationnCr=r(r−1)...1n(n−1)...(n−r+1). We can alternatively find the probabilities for case-1 P(2B,1W) and case-2 P(2W,1B) and then add them to get the required probability P(A) as they are mutually exclusive events.