How-many-distinct-ways-are-there-for-a-knight-to-reach-from-bottom-left-corner-of-chessboard-to-top-right-corner-knight-going-from-square-a1-to-h8-

Question Number 4105 by prakash jain last updated on 28/Dec/15

How many distinct ways are there for

a knight to reach from bottom left corner of

chessboard to top right corner .

(knight going from square a 1 to h 8) .

Commented by Filup last updated on 29/Dec/15

Without re using the same space ?

Commented by Filup last updated on 29/Dec/15

Chess board B is 8 \times 8 .

B therefore has 64 squares .

The knight / horse K can move

2 \times 1 or 1 \times 2 spaces a time .

Moving down 2 each step is 4 moves

Moving horizontal 2 each step is 4 moves

∴ You can reach the further most

row / column in ⩾ 4 moves

Alternating gives you :

- ? ? ? -

- continue -

i shall continue to think

Facebook Tweet Pin