In how many no. of ways can a knight walk from top left square to the bottom right square of an n X n chessboard if only following 2 moves are allowed

a) 1 right 2 down b) 1 right 2 up.

Printable View

- September 12th 2009, 06:27 AMintegerfanknight's restricted walk
In how many no. of ways can a knight walk from top left square to the bottom right square of an n X n chessboard if only following 2 moves are allowed

a) 1 right 2 down b) 1 right 2 up. - September 12th 2009, 06:34 AMCaptainBlack