Okay, imagine a chessboard, just 10x10 big(chessboard is 8x8 squares).
(I know that it is not squares, but that is irrelevant)
You start at the red dot, and you are to move to the brown dot.
You can move one square at a time, but only to the right or upwards. That makes that there are a lot of ways to get to the brown dot.
The question is, how many possible ways are there to get to the brown dot?
(This is not a trick question, this is math )