Combinatorial question

  • Thread starter ParisSpart
  • Start date
  • #1
ParisSpart
129
0
A rabbit lives on an ordinary chessboard 8x8. The rabbit located over the cell (1.1) (lower left, the upper right corner is (8.8), the lower right corner is (8,1)). At any time the rabbit jumps either to the right or upwards.

How many different ways can move the rabbit to reach the cell (3.4)?


I have a problem here.I think all the moves in the chessboard is (64 C 8) like (n C k) combinations, but i can not think how to move from the cell (1.1) to (3.4) maybe someone can give me any suggestion how?
 

Answers and Replies

  • #2
Simon Bridge
Science Advisor
Homework Helper
17,874
1,657
To understand the problem - draw out the chessboard and locate the cells.
Start tracing out possible paths manually - at some point you'll see a pattern emerge.
 
  • #3
ParisSpart
129
0
but the there are a lot of paths... maybe we can find another way to find them with combinatorial types?
 
  • #4
Simon Bridge
Science Advisor
Homework Helper
17,874
1,657
Rabbit can only move right or upwards though - that severely restricts the number of paths.

Of course there is a shortcut involving combinations etc.
Your problem is how to find it - with the first step being to understand the problem.

Another way: since you already solved how to get to (8,8) from (1,1) ... presumably you can do it for any size square board?
So how does that work?
 
  • #5
ParisSpart
129
0
i will try to estimate it and i will post the result here to find out if its correct
 
  • #6
ParisSpart
129
0
i find it there are 10 ways to move right and up in the chessboard!
 
  • #7
Simon Bridge
Science Advisor
Homework Helper
17,874
1,657
well done - how did you do that?
 
  • #8
ssd
268
6
The rabbit reaches (8,8) from (1,1) in 14C7= 14!/(7!.7!) ways, if the rabbit jumps only one square at a time.
Call a rightward jump 'R' and upward jump 'U'. The answer is the total number of linear permutation of 7 R's and 7 U's.
Similarly, to reach (m,n) the rabbit can move in
(m+n-2)!/ [(m-1)!(n-1)!] ways.
 
Last edited:
  • #9
Simon Bridge
Science Advisor
Homework Helper
17,874
1,657
Well done.
The answer is not so important as how you got to it.
Also I hope you can see that you sometimes have to mess about with a problem for a bit before finding out the short, simple, way to do it. Don't be scared to start a problem without knowing how to get to the answer.
 

Suggested for: Combinatorial question

  • Last Post
Replies
1
Views
613
  • Last Post
Replies
20
Views
1K
  • Last Post
Replies
2
Views
1K
  • Last Post
Replies
20
Views
4K
  • Last Post
Replies
6
Views
448
MHB Question
  • Last Post
Replies
2
Views
634
  • Last Post
Replies
9
Views
468
  • Last Post
Replies
4
Views
1K
  • Last Post
Replies
8
Views
426
  • Last Post
Replies
3
Views
474
Top