Checkers Problem

  • #1
All right...I've been at this all night, and any help whatsoever would be appreciated!

Problem-
An eight by eight square game board for checkers has a checker positioned in the fourth square of the bottom row. The checker is allowed to move one square at a time diagonally left or right to the row above. After seven moves the checker will be in the top row. How many different paths will lead to the top row?
 

Answers and Replies

  • #2
Hurkyl
Staff Emeritus
Science Advisor
Gold Member
14,950
19
Start with the first row. Write in each square the number of paths that lead from the starting position to that square. (there will be seven zeroes and one one)

Use the numbers in the first row to figure out the number of paths from the starting square to each square in the second row.

Use the numbers in the second row to figure out the numbers in the third row.

Keep doing this until you've filled the last row, then just add up the numbers!
 
  • #3
Danke!! Very much!! I owe you one!! *runs off to solve problem*


EDIT: Final answer? 41 Wow...a lot smaller than what I was getting before...103...>_<
 
Last edited:

Related Threads on Checkers Problem

  • Last Post
Replies
4
Views
5K
  • Last Post
Replies
3
Views
738
  • Last Post
Replies
3
Views
1K
  • Last Post
Replies
2
Views
6K
Replies
7
Views
5K
  • Last Post
Replies
3
Views
819
Replies
16
Views
4K
Replies
2
Views
5K
Replies
13
Views
4K
Top