Help Needed on simple Math Problem

Thread View: sci.math.num-analysis

2 messages

[T] Back to Threads [V] Tree View [G] Group Articles

2 total messages Started by Glenn Dickins Fri, 31 Jul 1992 14:48

#162

Author: Glenn Dickins
Date: Fri, 31 Jul 1992 14:48

16 lines
921 bytes

Hi Im not sure if this is the correct group I
apologize if its not, 
anyway i have recently been confronted with a problem
it follows-

there are 3 piles of stones 1 pile with 3 stones 1 with 5 stones and the last with 7 stones.

Anyway, u can take anynumber of stones from 1 pile must be > 1, and u go first, and someone else
then takes 1 or more stones from a pile, the person taking the last stone loses.

Whats the name of this problem, and can anyone tell me the problem soln please.
Its veryimpportant.

Thanx

 Glenn

Re: Help Needed on simple Math Problem

#165

Author: Ajay Shah
Date: Fri, 31 Jul 1992 22:52

20 lines
1200 bytes

vic@vulcan.anu.edu.au (Glenn Dickins) writes:

>Hi Im not sure if this is the correct group I
No it's not.

>there are 3 piles of stones 1 pile with 3 stones 1 with 5 stones and the last with 7 stones.
>Anyway, u can take anynumber of stones from 1 pile must be > 1, and u go first, and someone else
>then takes 1 or more stones from a pile, the person taking the last stone loses.
This game is called nim.
The winning strategy works as follows:
you throw the other guy into losing positions.
They are: n,n; 1,1,1; 3,2,1; 5,4,1
To get there, move first, and take one stone (from any pile).

I calculated this the painful way 15 years ago.  Is there a good theory
for it?

        -ans.
-- 
Ajay Shah, (213)749-8133, ajayshah@usc.edu

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads