Problem Solving Episode: Pascal's Method Part 2

Since we cannot make it to the red squares, I imagine them being 0. I then simple add the moves as normal:

And finally to answer the question, simply add the numbers in the top row:

3 + 6 + 6 + 3 = 18 paths to the top of the board.

Review/Extend:

This was a fairly easy question, by remembering to follow the rules of the question and the theory itself, the path was calculated perfectly.