Is there a mathematical approach for this or u simply have to count the number of routes....thnkx
- Attachments
-
counted the routes one by one
. Ended up with 10. However, if you do want to use permutations, you can do it as below --
Total number of moves for shortest path = 5
Total number of paths possible with 5 moves = 5!
There are 3 horizontal and 2 vertical moves. So, divide by 2! and 3!
to prune duplicates.
So, total = 5! / (3! * 2!) = 10
