Pascals Triangle (Checkerboard Question)

[crosby87]

Hello,

I'm a little confused as to how I can go about solving this problem.. Any help is appreciated.

Homework Statement

Draw and copy the following checkerboard. Then, on the board, show all of the paths that the checker piece can take to reach the bottom square marked with an “X,” without going through the two blacked-out squares. Remember, the checker piece can only move diagonally forwards by one square at a time, in this case, using the white squares only. How many paths are there in total?

The Attempt at a Solution

In my answer I got 8 as the number of paths to reach the bottom square marked with an "X". Is this correct?

Thanks

 

[symbolipoint]

I only find TWO paths to reach the X. The first move has exactly two choices. The remaining choices will all be along the same diagonal direction to reach the X white square. Your condition includes moving FORWARD only. If you deviate away from the main diagonal path straight to the X, then you will miss the X.

 

[crosby87]

So your saying this would be the correct method?

 

[Mentallic]

Those squares with the 4's and 6, and that 2 on the right wall nearest to the bottom need to be removed. You can't land on those squares and still reach the X.

 

[crosby87]

Sorry guys, I don't know if its just me or what but I'm still not getting this :S

 

[Mentallic]

Sorry guys, I don't know if its just me or what but I'm still not getting this :S

There isn't much to get. When you get to the second square (either by first moving left or right), there is only 1 way to get to the X from that position and that is by moving diagonally straight towards it.

 

[crosby87]

So essentially x would be.. 2?

 

[symbolipoint]

That number for categorizing the labeled squares seems to fit. What you have wanted to know was how many paths are possible for reaching the square labeled "X". That answer is, two paths.

 

[crosby87]

Ah man, guess I need to read the question properly next time! Thanks!