# Counting paths through a checkers board (only moving diagonally)

a) Imagine that a checker is placed in the bottom right corner of a 6 by 6 checker board. The piece mmay be moved one square at a time diagonally left or right to the next row up. Calculate the number of different paths to the top row. b) repear part (a) with the checker placed in the bottom right corner.

Okay, so I tried using pascal's triangle for this. I calculted all the paths leading the the top row, then I added them (I got 1+5+10= 16) The textbook says the answer is 10.

I understand there is a way to do this with combinatorics, but I don't really understand it. Please explain to me in both ways, if possibble.

• I got the answer using Pascal's triangle. I miscalculated something. However. if anoyone knows how to answer using Combinatorics, I would appreciate your help. – Kirmi Choksi Nov 29 '18 at 15:47
• For both parts, you indicated that the checker is first placed in the bottom right corner. – N. F. Taussig Nov 29 '18 at 20:19

$${n \choose {\left \lfloor {n/2}\right \rfloor}}= {5 \choose 2} = 10$$
The number of ways of reaching the top row is $$1+4+5=10$$.