You've already asked this problem and it's answered here. Please don't create multiple threads.
Ok this is kind of tough to explain. It's an EC problem but i have no idea where to start, should I find a pattern?
There is a checkerboard that is 60 squares in length by 58 squares in width.
You want to travel from the top left corner to the bottem right corner. But you can only move down or right.
How many paths can you take?
Heres an example of a possible path if the board was smaller and perfectly square. As you can see you can only move right or down.