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.
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.
This must consist of exactly 8 moves 6 of which are a and 2 of which are b.
Now enumeration of legal walks under these restrictions will yield the answer (or a bit more thought might reduce the effort required further).