in Combinatory retagged by
1,702 views
2 votes
2 votes
in Combinatory retagged by
1.7k views

4 Comments

But it is not yet solved .
1
1
edited by
2
2
Here, question is slightly more trickier as root can jump multiple squares :)
2
2

1 Answer

5 votes
5 votes
Best answer

This is an example of Permutation with repeated characters. 

To go to from (0,0) (consider, southeast corner) to (8,8) (consider northwest corner) we need to take 7 Up turn and 7 right turn. It means that its a forming a string like UUUUUUURRRRRRR (Whatever the way you go, you have to take 7 Up and 7 right to reach (8,8)). Now our job is it find the how many permutation can be formed from this string. Which is a very simple task. 

Total Number of permutation will be : ( factorial(14) / (factorial(7) * factorial(7))). Which is equivalent to 14C7.

Hence option B is correct

selected by
by

4 Comments

yes. The question setter would have meant this. But the other can be a programming question. Like Google and all ask such questions.
0
0
Sir, Then please mark it as best answer :P :P
0
0
ok :)
0
0