i need some help on a (sort of) math puzzle i have come in contact with recently. its is a competitive game, with 15 nails or pegs. the 15 nails are put on a board, arranged in rows of 3 5 and 7. on a persons turn, they may pick as many nails (or beans, or whatever) from any given row, they can only take from that row, no other row on that turn. the 2 people take turns picking as many or few as they want from one row per turn, until only one is left. they person who takes that last one wins.below, an x indicating a peg and 0 meaning pegs that have been taken, a game might begin with the first move resulting in the second, the second move resulting in #3, and so on
1)XXX 2)00X 3)00X 4)00X 5)000
XXXXX 2)XXXXX 3)0XXXX 4)0XXX0 5)0XXX0
XXXXXXX 2)XXXXXXX 3)XXXXXXX 4)XXXXXXX 5)XXXXXXX
6)000 7)000 8)000
6)0XXX0 7)00000 8)00000
6)000000X 7)000000X 8)0000000
in this case, the person who made move 8 lost
if u know or figure out a sure-fire strategy, ie. take the same as the other person, or take an amount to total 3, or an even number or what ever, please email the solution to fitzy2006@msn.com or, if u just have some advice, feel free to send a mail tyvm for your help