How to solve a problem with chessboard I am beginning math student and encountered following task which I do not know how to solve:
There is chessboard, ie 8x8 tiles. In the top left corner there is pawn. He cannot go diagonally and he can only move down and right.
1)How many steps will he need to reach the right bottom corner shortest way?
2)How many of these ways do exist?
Thank you in advance

Hint: 


*

*Can you find any route? How many steps?  How about another? And another? Any pattern?

*Slightly harder.  Can you find how many routes there are to squares near the start? How about slightly further away? How about each square on the chaessboard?  

