Mixing
Is Nim a (strong) positional game?
$begingroup$
A positional game is a kind of a combinatorial game described by:
$X$ a finite set of elements. (Often $X$ is called the board and its
elements are called positions.)
$F$ a family of subsets of $X$. (These subsets are usually called the winning-sets.)- A criterion for winning the game.
For $n$-pile Nim, wouldn't $X$ be the union of disjoint posets, e.g. ${(1,2,...,k_1), (1,2,...,k_2),..., (1,2,...,k_n)}$? Then a move consists of choosing a point in one of the posets and removing that point and everything above it in said poset.
Then $F$ would be ${{{(1,2,...,j),(),()}}, {{(),(1,2,...,j),()}}, {{(),(),(1,2,...,j)}}}$
And the winning criterion is being the first one to "receive" a position in $F$?
This seems right to me, but it appears that player two can have a winning strategy, which contradicts the notion of Nim being strong positional.
game-theory combinatorial-game-theory
asked Jan 30 at 10:41
Tiwa AinaTiwa Aina
2,720421
$endgroup$
add a comment |
$begingroup$
A positional game is a kind of a combinatorial game described by:
$X$ a finite set of elements. (Often $X$ is called the board and its
elements are called positions.)
$F$ a family of subsets of $X$. (These subsets are usually called the winning-sets.)- A criterion for winning the game.
For $n$-pile Nim, wouldn't $X$ be the union of disjoint posets, e.g. ${(1,2,...,k_1), (1,2,...,k_2),..., (1,2,...,k_n)}$? Then a move consists of choosing a point in one of the posets and removing that point and everything above it in said poset.
Then $F$ would be ${{{(1,2,...,j),(),()}}, {{(),(1,2,...,j),()}}, {{(),(),(1,2,...,j)}}}$
And the winning criterion is being the first one to "receive" a position in $F$?
This seems right to me, but it appears that player two can have a winning strategy, which contradicts the notion of Nim being strong positional.
game-theory combinatorial-game-theory
asked Jan 30 at 10:41
Tiwa AinaTiwa Aina
2,720421
$endgroup$
add a comment |
$begingroup$
A positional game is a kind of a combinatorial game described by:
$X$ a finite set of elements. (Often $X$ is called the board and its
elements are called positions.)
$F$ a family of subsets of $X$. (These subsets are usually called the winning-sets.)- A criterion for winning the game.
For $n$-pile Nim, wouldn't $X$ be the union of disjoint posets, e.g. ${(1,2,...,k_1), (1,2,...,k_2),..., (1,2,...,k_n)}$? Then a move consists of choosing a point in one of the posets and removing that point and everything above it in said poset.
Then $F$ would be ${{{(1,2,...,j),(),()}}, {{(),(1,2,...,j),()}}, {{(),(),(1,2,...,j)}}}$
And the winning criterion is being the first one to "receive" a position in $F$?
This seems right to me, but it appears that player two can have a winning strategy, which contradicts the notion of Nim being strong positional.
game-theory combinatorial-game-theory
asked Jan 30 at 10:41
Tiwa AinaTiwa Aina
2,720421
$endgroup$
A positional game is a kind of a combinatorial game described by:
$X$ a finite set of elements. (Often $X$ is called the board and its
elements are called positions.)
$F$ a family of subsets of $X$. (These subsets are usually called the winning-sets.)- A criterion for winning the game.
For $n$-pile Nim, wouldn't $X$ be the union of disjoint posets, e.g. ${(1,2,...,k_1), (1,2,...,k_2),..., (1,2,...,k_n)}$? Then a move consists of choosing a point in one of the posets and removing that point and everything above it in said poset.
Then $F$ would be ${{{(1,2,...,j),(),()}}, {{(),(1,2,...,j),()}}, {{(),(),(1,2,...,j)}}}$
And the winning criterion is being the first one to "receive" a position in $F$?
This seems right to me, but it appears that player two can have a winning strategy, which contradicts the notion of Nim being strong positional.
game-theory combinatorial-game-theory
game-theory combinatorial-game-theory
asked Jan 30 at 10:41
Tiwa AinaTiwa Aina
2,720421
asked Jan 30 at 10:41
Tiwa AinaTiwa Aina
2,720421
asked Jan 30 at 10:41
Tiwa AinaTiwa Aina
2,720421
asked Jan 30 at 10:41
Tiwa AinaTiwa Aina
2,720421
asked Jan 30 at 10:41
Tiwa AinaTiwa Aina
2,720421
2,720421
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
No. For a positional game, the legal moves are to take any element of $X$ which hasn't already been taken. In this setting of Nim, taking an element of one of the posets can mean that several other elements of $X$ stop being legal moves.
Also, I don't think your $F$ makes sense. $F$ should be the sets such that if you can take all of one set in $F$, you win the game. That's not what you have (your $F$ would mean that the winner is the first to take the last $j$ elements of one of the posets).
answered Jan 30 at 10:48
Especially LimeEspecially Lime
22.7k23059
$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: "69"
};
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: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
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
});
}
});
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%2fmath.stackexchange.com%2fquestions%2f3093364%2fis-nim-a-strong-positional-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$
No. For a positional game, the legal moves are to take any element of $X$ which hasn't already been taken. In this setting of Nim, taking an element of one of the posets can mean that several other elements of $X$ stop being legal moves.
Also, I don't think your $F$ makes sense. $F$ should be the sets such that if you can take all of one set in $F$, you win the game. That's not what you have (your $F$ would mean that the winner is the first to take the last $j$ elements of one of the posets).
answered Jan 30 at 10:48
Especially LimeEspecially Lime
22.7k23059
$endgroup$
add a comment |
$begingroup$
No. For a positional game, the legal moves are to take any element of $X$ which hasn't already been taken. In this setting of Nim, taking an element of one of the posets can mean that several other elements of $X$ stop being legal moves.
Also, I don't think your $F$ makes sense. $F$ should be the sets such that if you can take all of one set in $F$, you win the game. That's not what you have (your $F$ would mean that the winner is the first to take the last $j$ elements of one of the posets).
answered Jan 30 at 10:48
Especially LimeEspecially Lime
22.7k23059
$endgroup$
add a comment |
$begingroup$
No. For a positional game, the legal moves are to take any element of $X$ which hasn't already been taken. In this setting of Nim, taking an element of one of the posets can mean that several other elements of $X$ stop being legal moves.
Also, I don't think your $F$ makes sense. $F$ should be the sets such that if you can take all of one set in $F$, you win the game. That's not what you have (your $F$ would mean that the winner is the first to take the last $j$ elements of one of the posets).
answered Jan 30 at 10:48
Especially LimeEspecially Lime
22.7k23059
$endgroup$
No. For a positional game, the legal moves are to take any element of $X$ which hasn't already been taken. In this setting of Nim, taking an element of one of the posets can mean that several other elements of $X$ stop being legal moves.
Also, I don't think your $F$ makes sense. $F$ should be the sets such that if you can take all of one set in $F$, you win the game. That's not what you have (your $F$ would mean that the winner is the first to take the last $j$ elements of one of the posets).
answered Jan 30 at 10:48
Especially LimeEspecially Lime
22.7k23059
answered Jan 30 at 10:48
Especially LimeEspecially Lime
22.7k23059
answered Jan 30 at 10:48
Especially LimeEspecially Lime
22.7k23059
answered Jan 30 at 10:48
Especially LimeEspecially Lime
22.7k23059
22.7k23059
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics 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%2fmath.stackexchange.com%2fquestions%2f3093364%2fis-nim-a-strong-positional-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
