Pascals triangle pathways Hey Guys I really really need help with my data management problem. I've been racking my brain trying to figure out what to do. It deals with pascals triangle. The pegboard game is shown above. I really need help I genuinely do not know how to find the amount of paths, and because of that I can't move on. The questions is..


  Determine the total number of paths to the bottom of the game board (for each path). Include a separate game board for each starting slot (A-H)
If the numbers at the bottom don't mean anything and you just want the number of paths downward through the dotted squares, it is just like Pascal's triangle.  Starting from where you indicate there is one way to the neighboring cells on the top line and zero ways to all the other cells.  Now fill in the second line with each cell getting the sum of the two above.  It will exactly follow Pascal's triangle until the edges start to matter, when the numbers will be smaller.  Where are you stuck?
If the numbers at the bottom don't mean anything and you just want the number of paths downward through the dotted squares, it is just like Pascal's triangle.  Starting from where you indicate there is one way to the neighboring cells on the top line and zero ways to all the other cells.  Now fill in the second line with each cell getting the sum of the two above.  It will exactly follow Pascal's triangle until the edges start to matter, when the numbers will be smaller.  Where are you stuck?