Chess+Math=

Sort:
sfxe

In a chess variant, a "lord" can move one space at a time, either upward, or to the right, or diagonally up 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?

GenerousSidewalk

many

sfxe

b r u h 

 

GenerousSidewalk

Plugging this in my math machine, I get 48639

GM_chess_player

48?

DrSheepenstein

10905

 

1c6O-1

696969696969

KovenFan
Chessguy149 wrote:

In a chess variant, a "lord" can move one space at a time, either upward, or to the right, or diagonally up 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?

Trivial

KovenFan
Chessguy149 wrote:

In a chess variant, a "lord" can move one space at a time, either upward, or to the right, or diagonally up 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?

Edit: my solution does not apply to the right piece.

Let,

a "path" be defined as a sequence of moves that takes a lord from a1 to h8.

a "knight move" be used for the third movement you described the lord being able to make that involves the piece moving diagonally up and then right.

 

Some few lemmas that are easy to prove:

1. Whatever path the piece takes he ends up moving up(i.e moving from a1 to a2) 7 times and right(i.e moving a1 to b2) 7 times.

2. The knight move is basically moving up once and twice to the right.

3. If C is the number of knight moves in a path, -1>C< 4 for any path

4. We can create a string representation of any path. Imagine a lord going from a1 to a8 and then to h8, we can represent that as UUUUUUURRRRRRR where U means up and R means right. Another example is UUUUUURRRRRK where the K represents a knight move.

 

My post is getting kinda long so I'll have to shorten it but if you understand everything I've said above, you'll see that we've reduced the problem to working out a few permutation related calculations that add up to the answer of the problem which is 11776.

sfxe

actually this was part of my math homework (art of problem solving anyone) and i entered 48639 and it was correct. -_- 

sfxe

plus the knight doesn't move twice to the right it moves once

sfxe

for the problem (not in real chess)

 

sfxe

so basically what i mean is that 1. your solution makes no sense and 2. you're wrong

KovenFan
 Chessguy149 wrote:

plus the knight doesn't move twice to the right it moves once

I never said the knight moves only twice to the right. What I said was if we had a knight in a1, and it moved diagonally up(a1 to b2) and to the right(b2 to c2) it is the same thing as moving up on step once(a1 to a2) and twice to right(a2 to b2 to c2).

sfxe

lmao long story short the answer is the 40k one

sfxe

n o i c e