This is a Nim-style game. There is a lot of information available on the
web for winning strategies for this class of games.
In general, the idea is to start with the basic winning configurations.
These are situations where you can win on that turn. For this game, this is
any case where there
can anyone tell how to detect cycles in the game of nim ?
for eg. if there are x coins, and two players are taking out coins
alternatively, such that the one who has no choice loses... and the
number of coins allowed to take in one go are {2, 4, 5}, then the whole
cycle is repeating after
On Oct 3, 4:49 am, eSKay catchyouraak...@gmail.com wrote:
okay...
perhaps
It's a 2-player game that's deterministic, zero-sum, perfect
information, finite, and without ties. So a winning strategy exists
for one of the players.
should have been mentioned... I didn't know that.
Btw, what
okay...
perhaps
It's a 2-player game that's deterministic, zero-sum, perfect
information, finite, and without ties. So a winning strategy exists
for one of the players.
should have been mentioned... I didn't know that.
Btw, what is the proof of the statement I just quoted?
thanks
On Oct 2,
Good job !!
just to add , i think the exact winning strategy would be based on
distribution of factors of numbers and that would depend on
distribution of primes...
So it occurs to me that there might not be a closed form winning
strategy possible !
Still thanks for the proof !
cheers
-
I agree with you. If we remove 1 from the initial status, the
situation seems rather complex.
However, it's a very interesting problem.
On Oct 2, 12:41 pm, nikhil nikhilgar...@gmail.com wrote:
Good job !!
just to add , i think the exact winning strategy would be based on
distribution of
What exactly do you prove here?
You just make some statements, which should be proved. shouldn't it?
Or am I missing something??
On Oct 2, 7:08 am, saltycookie saltycoo...@gmail.com wrote:
Here is a proof. Unfortunately, the proof is not constructive.The
secret of winning is 1, which is a
On Oct 2, 7:20 am, eSKay catchyouraak...@gmail.com wrote:
What exactly do you prove here?
The first player always has a winning move.
You just make some statements, which should be proved. shouldn't it?
Or am I missing something??
It's a 2-player game that's deterministic, zero-sum,
Manish Garg wrote:
so N and k is given to us and we have to tell that who will be the
last person.
IIRC there is something on this in ``Concrete Mathematics'' by Knuth
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google
A classic problem: http://en.wikipedia.org/wiki/*Josephus*_*problem*
On 2/22/07, Ravi Shankar [EMAIL PROTECTED] wrote:
Manish Garg wrote:
so N and k is given to us and we have to tell that who will be the
last person.
IIRC there is something on this in ``Concrete Mathematics'' by
Pick up the book introduction to algorithms: Cormen or data
structures:tanenbaum It's available in you library. Go through it.
Also browse the websites given by the others above
They all sit in a circle such that their numbering order is also maintained,
so that the last person (numbered N) sits
Try googling for Josephus Permutation
On 2/22/07, Manish Garg [EMAIL PROTECTED] wrote:
hi,
I m posting a game, its like this:
Suppose N people are playing the game. All of them are numbered from 1 to
N. They all sit in a circle such that their numbering order is also
maintained, so that
12 matches
Mail list logo
