I came across this somewhere on the web.
A pawn is sitting at one corner of an 8X8 chess board. It can take one step at a time in the horizontal or vertical direction (not diagonal). What is total number of ways in which it can reach the diagonally opposite end given that the pawn always tries to go towards the destination (i.e. no back-tracking).
I came up with an answer. Wanted to see whether it is the correct approach. Thank you
Hope you will enjoy