A probability question i think
posted by Knights on .
In a chess variant, a "lord" can move one space at a time, either upward, or to the right, or diagonally upward and to the right. How many ways are there for a lord to move from the bottom left to top right corner of the 8 by 8 chessboard?
Thanks in advance for helping me!

Each move advances either upward or rightward or both. If there are n diagonal moves, then there are 14n up or right moves. So, there may be 0 to 7 diagonal moves, and the rest can be chosen in two ways.
so, there are
(0+2^14) + (1+2^12) + (2+2^10) + ... + (7+0) = 21872 
ok thanks alot steve you really help alot

steve is wrong...

You are wrong

You guys....actually try to help out please.
Here, make a chart that cascades to the upperrightmost square. Kinda like Pascal's Triangle.
1............. 48639
1...................
1...................
1...................
1 7 25..............
1 5 13 .............
1 3 5 7 9...........
1 1 1 1 1 1 1 1 1 1 1
So the answer is 48639.