Find the number of ways a knight can move from top left square to
bottom right square in an M*N Chess board with only the following
moves allowed:
a) 1 square right ; 2 squares down
b) 1 square right ; 2 squares up and
b) 2 squares right ; 1 square down.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
