|
|
#1 |
|
FFR Player
|
i need major help with this math problem...
a mouse is located in the top left corner of an 8X8 checkerboard and it needs to get the the cheese (located in the bottom right). if the mouse can only move either down or right, how many different paths can he take?? as well as the way you got the answer!! i had a few clues.... start with 2X2, then 3X3 etc and see if you can find a pattern.. (i did that but i lost count on the 4X4) |
|
|
|
|
#2 |
|
is against custom titles
|
We're not here to do your homework.
Though, I suggest making a tree of options. --Guido http://andy.mikee385.com
__________________
![]() Last edited by GuidoHunter; 05-13-2007 at 06:40 PM.. |
|
|
![]() |
| Currently Active Users Viewing This Thread: 1 (0 members and 1 guests) | |
|
|