Chess Antics

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?


The answer is 3432.

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.

2 solutions

Satvik Golechha
Sep 29, 2014

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 Chessboard

Now, we need to go from ( 0 , 0 ) (0,0) to the lattice point ( 7 , 7 ) (7,7) . So, we need to go up the axis 7 7 times and towards the right 7 7 times. Let's denote them by x x and y y respectively.

We need 7 7 x s x's and 7 7 y s 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 x y x x y y y x y x y x y x will do.

So we need a total of 14 14 things, divided in 2 2 groups of 7 7 same things each.

Now it's easy. The number of ways to order 14 14 things, of which 7 7 are of one kind (x) and 7 7 are of another king (y) is given by:-

14 ! 7 ! × 7 ! = 3432 \frac{14!}{7! \times 7!}= \boxed{3432}

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

Nice question @Sharky Kesa

Satvik Golechha - 6 years, 8 months ago

Log in to reply

You could've used Pascal's Triangle, you know? Nice solution anyway. :D

Sharky Kesa - 6 years, 8 months ago
Satyen Nabar
Sep 29, 2014

The rook will have to move 7 steps right and 7 steps down. The number of such paths is the number of combinations of 14 steps, 7 of which are down and the other 7 of which are right. That`s 14C7= 3432 ways.

ya.. most elegant thinking..

Ananya Aaniya - 4 years, 10 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...