If on a chess board two of squares are chosen at random, then the probability that they have a side in common can be written
n m
Find
m + n
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Hmm sorry to disturb but could you please explain me the first part of your solution, ie how you obtained the number of interior sides?
Log in to reply
Looking at the chess board as a whole, there are 7 vertical interior boundary lines, each having a 'length' of 8 squares, and 7 horizontal interior boundary lines, each also having a length of 8 squares.
Thus there are 7 ∗ 8 = 5 6 vertical interior sides shared by precisely 2 squares, and the same number of horizontal interior sides shared by precisely 2 squares. This gives us a total of 2 ∗ 5 6 = 1 1 2 shared sides, and thus a total of 1 1 2 pairs of squares with a side in common.
Hope that makes sense. :)
Log in to reply
Ohh okay. Thanks for the explanation :)
Is there any problem you cant solve :p( I guess this problem has already been posted)
Log in to reply
@Krishna Sharma – Haha Well, thanks for the compliment, but the list of problems I can't solve is a million times longer that the list of those I can. I even have a little notebook of questions I have asked myself that I would like to post, but I haven't figured out the answers yet. If there is a problem that I find interesting but can't solve, I will keep coming back to it over time and see if a different approach will help.
As for this question, I have posed it to myself in the past so I knew how to proceed once I read it. The chess board is a great basis for interesting problems to try and solve. :)
Log in to reply
@Brian Charlesworth – Hats off to u man....Your approach to any problem is different from the stream and I find it extremely convenient .....
1) There total 64 squares on a chess board, arranged in 8x8 form
2) There are 4 corner squares where only 2 other squares share a side so total number of ways for such a square = (4x2)
3) There are 24 squares touching the boarder of the chess board (excluding 4 corner squares) where 3 other squares share a side.=> (24x3)
4) There are remaining 36 squares where 4 other squares share a side => (36x4)
So, total number of ways in which a square can be selected with one side shared is = (4x2) + (24x3) + (36x4) = 224
& total number of ways in which a square can be selected = 64x63
So, probability of selecting one square such that one of it sides is in common = 224/(64x63) = 1/18
It's good explanation except you must tell that you doubled numbers of solutions, so answer is (224/2)/(64*63/2),getting same result...
On a chess board we have 64 squares,
And there are:
(1) 4 corner squares, with ONLY 2 squares with which they share a common side..
(2) 6*4 = 24 side squares, with 3 squares with which they share a common side..
(3) 6*6 = 36 inner squares, with 4 squares with which they share a common side..
So we have
P = (4/64) (2/63) + (24/64) (3/63)+ (36/64)*(4/63) P = 1/18
Problem Loading...
Note Loading...
Set Loading...
There are 2 ∗ 7 ∗ 8 = 1 1 2 interior sides on a chess board, and there is a one-to-one correspondence between these sides and the pairs of squares that have a side in common.
Now without restrictions there are ( 2 6 4 ) pairs of squares that can be chosen at random, and so the desired probability is
( 2 6 4 ) 1 1 2 = 6 4 ∗ 6 3 2 2 4 = 1 8 1 .
Thus m + n = 1 + 1 8 = 1 9 .