The rook is a chess piece that can only move horizontally or vertically. There is a rook placed on an 8 by 8 empty chessboard on the top left hand corner. It is to arrive at the bottom right hand corner. If it can only move downwards or right, and can only travel 1 space per turn, how many different ways are there to accomplish this task?
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.
Imagine that you're an ant and are standing at the top left starting point of the rook, facing towards the down right, the destination. Now, with your frame of reference, it'll look something like this:-
Chessboard
Now, we need to go from ( 0 , 0 ) to the lattice point ( 7 , 7 ) . So, we need to go up the axis 7 times and towards the right 7 times. Let's denote them by x and y respectively.
We need 7 x ′ s and 7 y ′ s , no matter the order, we'll reach the same place.
Something like x y x x y y y x y x y x y x will do.
So we need a total of 1 4 things, divided in 2 groups of 7 same things each.
Now it's easy. The number of ways to order 1 4 things, of which 7 are of one kind (x) and 7 are of another king (y) is given by:-
7 ! × 7 ! 1 4 ! = 3 4 3 2
Hope everything is explained. I know that the imagination was unnecessary, but it makes the problem and the solution more interesting and easy to understand. -Satvik