Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

Consider the following game. It is one of the many variants of Nim, also known a

ID: 3807698 • Letter: C

Question

Consider the following game. It is one of the many variants of Nim, also known as the Marienbad game. Initially there is a heap of matches on the table between two players. The first player may remove as many matches as he likes, except that he must take at least one and he must leave at least one. There must therefore be at least two matches in the initial heap. Thereafter, each player in turn must remove at least one match and at most twice the number of matches his opponent just took. The player who removes the last match wins. There are no draws.

Suppose we change the rules of the game above so that the player who is forced to take the last match loses. This is the misère version of the game. Suppose also that the first player must take at least one match and that he must leave at least two. Among the initial positions with three to eight matches, which are now winning positions for the first player?

Explanation / Answer

Ans:There are two as the rule is reverse to actual game rule.

1) If m=1 and n=1, or m=n=1 then the player 1 has a winning strategy.

2) If mn, then player 1 has a winning strategy. (If m not equal to n then player 1 will be having the winning strategy).

Hire Me For All Your Tutoring Needs
Integrity-first tutoring: clear explanations, guidance, and feedback.
Drop an Email at
drjack9650@gmail.com
Chat Now And Get Quote