A short nim game
$begingroup$
There are 50 lucifers on the table.
The rules are:
-You may take 5 lucifers each turn.
-After player 1 has taken some amount of lucifers, it is player 2's turn.
-The player who takes the last lucifer wins!
Puzzle:
Find a strategy that you can almost always win.
Hint: It has to do with the amount of maximum lucifers you can take.
game nim
asked 9 mins ago
harmharm
1
New contributor
harm is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
$begingroup$
There are 50 lucifers on the table.
The rules are:
-You may take 5 lucifers each turn.
-After player 1 has taken some amount of lucifers, it is player 2's turn.
-The player who takes the last lucifer wins!
Puzzle:
Find a strategy that you can almost always win.
Hint: It has to do with the amount of maximum lucifers you can take.
game nim
asked 9 mins ago
harmharm
1
New contributor
harm is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
$begingroup$
There are 50 lucifers on the table.
The rules are:
-You may take 5 lucifers each turn.
-After player 1 has taken some amount of lucifers, it is player 2's turn.
-The player who takes the last lucifer wins!
Puzzle:
Find a strategy that you can almost always win.
Hint: It has to do with the amount of maximum lucifers you can take.
game nim
asked 9 mins ago
harmharm
1
New contributor
harm is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
There are 50 lucifers on the table.
The rules are:
-You may take 5 lucifers each turn.
-After player 1 has taken some amount of lucifers, it is player 2's turn.
-The player who takes the last lucifer wins!
Puzzle:
Find a strategy that you can almost always win.
Hint: It has to do with the amount of maximum lucifers you can take.
game nim
game nim
asked 9 mins ago
harmharm
1
New contributor
harm is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 9 mins ago
harmharm
1
New contributor
harm is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 9 mins ago
harmharm
1
New contributor
harm is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 9 mins ago
harmharm
1
asked 9 mins ago
harmharm
1
1
New contributor
harm is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
harm is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
harm is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
If you have to take exactly 5:
Well, the second player wins trivially.
If you can take a number from 1 up to 5 (which is what I'm assuming)
As the first player, always end on a multiple of 6. Start by taking 2 to bring the number to 48. No matter what your opponent does, bring it down to 42, then 36, then 30, then... you get the point. Eventually, you'll get it down to 6. Then your opponent has to leave 1 to 5, and you can take all of the remaining ones and win.
If you can take a number from 0 up to 5
The game will be deadlocked at 48, with neither player opting to take any because then the other player will bring it down to the next multiple of 6.
answered 3 mins ago
Excited RaichuExcited Raichu
6,31521065
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "559"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
harm is a new contributor. Be nice, and check out our Code of Conduct.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f78716%2fa-short-nim-game%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
If you have to take exactly 5:
Well, the second player wins trivially.
If you can take a number from 1 up to 5 (which is what I'm assuming)
As the first player, always end on a multiple of 6. Start by taking 2 to bring the number to 48. No matter what your opponent does, bring it down to 42, then 36, then 30, then... you get the point. Eventually, you'll get it down to 6. Then your opponent has to leave 1 to 5, and you can take all of the remaining ones and win.
If you can take a number from 0 up to 5
The game will be deadlocked at 48, with neither player opting to take any because then the other player will bring it down to the next multiple of 6.
answered 3 mins ago
Excited RaichuExcited Raichu
6,31521065
$endgroup$
add a comment |
$begingroup$
If you have to take exactly 5:
Well, the second player wins trivially.
If you can take a number from 1 up to 5 (which is what I'm assuming)
As the first player, always end on a multiple of 6. Start by taking 2 to bring the number to 48. No matter what your opponent does, bring it down to 42, then 36, then 30, then... you get the point. Eventually, you'll get it down to 6. Then your opponent has to leave 1 to 5, and you can take all of the remaining ones and win.
If you can take a number from 0 up to 5
The game will be deadlocked at 48, with neither player opting to take any because then the other player will bring it down to the next multiple of 6.
answered 3 mins ago
Excited RaichuExcited Raichu
6,31521065
$endgroup$
add a comment |
$begingroup$
If you have to take exactly 5:
Well, the second player wins trivially.
If you can take a number from 1 up to 5 (which is what I'm assuming)
As the first player, always end on a multiple of 6. Start by taking 2 to bring the number to 48. No matter what your opponent does, bring it down to 42, then 36, then 30, then... you get the point. Eventually, you'll get it down to 6. Then your opponent has to leave 1 to 5, and you can take all of the remaining ones and win.
If you can take a number from 0 up to 5
The game will be deadlocked at 48, with neither player opting to take any because then the other player will bring it down to the next multiple of 6.
answered 3 mins ago
Excited RaichuExcited Raichu
6,31521065
$endgroup$
If you have to take exactly 5:
Well, the second player wins trivially.
If you can take a number from 1 up to 5 (which is what I'm assuming)
As the first player, always end on a multiple of 6. Start by taking 2 to bring the number to 48. No matter what your opponent does, bring it down to 42, then 36, then 30, then... you get the point. Eventually, you'll get it down to 6. Then your opponent has to leave 1 to 5, and you can take all of the remaining ones and win.
If you can take a number from 0 up to 5
The game will be deadlocked at 48, with neither player opting to take any because then the other player will bring it down to the next multiple of 6.
answered 3 mins ago
Excited RaichuExcited Raichu
6,31521065
answered 3 mins ago
Excited RaichuExcited Raichu
6,31521065
answered 3 mins ago
Excited RaichuExcited Raichu
6,31521065
answered 3 mins ago
Excited RaichuExcited Raichu
6,31521065
6,31521065
add a comment |
add a comment |
harm is a new contributor. Be nice, and check out our Code of Conduct.
harm is a new contributor. Be nice, and check out our Code of Conduct.
harm is a new contributor. Be nice, and check out our Code of Conduct.
harm is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to Puzzling Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f78716%2fa-short-nim-game%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
