A simple game with $n$ points in 3D space - red triangle wins
(Once again a son is torturing his father...)
Alice and Bob play a fairly simple game with $n$ predefined points in 3D space. No four points are complanar (which also implies that no three points are collinear).
They play in turns by connecting points that are not yet connected with straight segments. On her turn Alice connects a single pair of unconnected points with a single segment of red color. After that Bob connects $k$ pairs of unconnected points with $k$ segments of blue color.
Alice wins if she is able to create a triangle with red sides. If all points are connected and Alice was not able to create a red sided triangle before that, Bob wins.
Who has a winning strategy?
My thoughts: obviously, the outcome of the game heavily depends on releation between $n$ and $k$.
Suppose that $k=1$ with big enough value for $n$. Alice will simply draw segment $AB$, Bob draws his segment at will, Alice then draws $AC$, Bob blocks triangle $ABC$ by drawing segment BC, Alice draws segment $AD$ and Bob is lost. He cannot block triangles $ABD$ and $ACD$ by drawgin a single segment.
On the other side, with $k$ big enough, Bob can easily block creation of all red triangles by drawing a lot of lines.
So for $kle k_1$, Alice wins. For $kge k_2ge k_1$, Bob wins. I need some estimate for $k_1$ and $k_2$ (better than mine). Also note that the game always has a winner. Does it mean that $k_1=k_2$? I guess it does, but if we are just trying to estimate the lower and the upper bound, we can come up with two different values.
combinatorics combinatorial-game-theory
asked 2 days ago
OldboyOldboy
7,1441832
add a comment |
(Once again a son is torturing his father...)
Alice and Bob play a fairly simple game with $n$ predefined points in 3D space. No four points are complanar (which also implies that no three points are collinear).
They play in turns by connecting points that are not yet connected with straight segments. On her turn Alice connects a single pair of unconnected points with a single segment of red color. After that Bob connects $k$ pairs of unconnected points with $k$ segments of blue color.
Alice wins if she is able to create a triangle with red sides. If all points are connected and Alice was not able to create a red sided triangle before that, Bob wins.
Who has a winning strategy?
My thoughts: obviously, the outcome of the game heavily depends on releation between $n$ and $k$.
Suppose that $k=1$ with big enough value for $n$. Alice will simply draw segment $AB$, Bob draws his segment at will, Alice then draws $AC$, Bob blocks triangle $ABC$ by drawing segment BC, Alice draws segment $AD$ and Bob is lost. He cannot block triangles $ABD$ and $ACD$ by drawgin a single segment.
On the other side, with $k$ big enough, Bob can easily block creation of all red triangles by drawing a lot of lines.
So for $kle k_1$, Alice wins. For $kge k_2ge k_1$, Bob wins. I need some estimate for $k_1$ and $k_2$ (better than mine). Also note that the game always has a winner. Does it mean that $k_1=k_2$? I guess it does, but if we are just trying to estimate the lower and the upper bound, we can come up with two different values.
combinatorics combinatorial-game-theory
asked 2 days ago
OldboyOldboy
7,1441832
add a comment |
(Once again a son is torturing his father...)
Alice and Bob play a fairly simple game with $n$ predefined points in 3D space. No four points are complanar (which also implies that no three points are collinear).
They play in turns by connecting points that are not yet connected with straight segments. On her turn Alice connects a single pair of unconnected points with a single segment of red color. After that Bob connects $k$ pairs of unconnected points with $k$ segments of blue color.
Alice wins if she is able to create a triangle with red sides. If all points are connected and Alice was not able to create a red sided triangle before that, Bob wins.
Who has a winning strategy?
My thoughts: obviously, the outcome of the game heavily depends on releation between $n$ and $k$.
Suppose that $k=1$ with big enough value for $n$. Alice will simply draw segment $AB$, Bob draws his segment at will, Alice then draws $AC$, Bob blocks triangle $ABC$ by drawing segment BC, Alice draws segment $AD$ and Bob is lost. He cannot block triangles $ABD$ and $ACD$ by drawgin a single segment.
On the other side, with $k$ big enough, Bob can easily block creation of all red triangles by drawing a lot of lines.
So for $kle k_1$, Alice wins. For $kge k_2ge k_1$, Bob wins. I need some estimate for $k_1$ and $k_2$ (better than mine). Also note that the game always has a winner. Does it mean that $k_1=k_2$? I guess it does, but if we are just trying to estimate the lower and the upper bound, we can come up with two different values.
combinatorics combinatorial-game-theory
asked 2 days ago
OldboyOldboy
7,1441832
(Once again a son is torturing his father...)
Alice and Bob play a fairly simple game with $n$ predefined points in 3D space. No four points are complanar (which also implies that no three points are collinear).
They play in turns by connecting points that are not yet connected with straight segments. On her turn Alice connects a single pair of unconnected points with a single segment of red color. After that Bob connects $k$ pairs of unconnected points with $k$ segments of blue color.
Alice wins if she is able to create a triangle with red sides. If all points are connected and Alice was not able to create a red sided triangle before that, Bob wins.
Who has a winning strategy?
My thoughts: obviously, the outcome of the game heavily depends on releation between $n$ and $k$.
Suppose that $k=1$ with big enough value for $n$. Alice will simply draw segment $AB$, Bob draws his segment at will, Alice then draws $AC$, Bob blocks triangle $ABC$ by drawing segment BC, Alice draws segment $AD$ and Bob is lost. He cannot block triangles $ABD$ and $ACD$ by drawgin a single segment.
On the other side, with $k$ big enough, Bob can easily block creation of all red triangles by drawing a lot of lines.
So for $kle k_1$, Alice wins. For $kge k_2ge k_1$, Bob wins. I need some estimate for $k_1$ and $k_2$ (better than mine). Also note that the game always has a winner. Does it mean that $k_1=k_2$? I guess it does, but if we are just trying to estimate the lower and the upper bound, we can come up with two different values.
combinatorics combinatorial-game-theory
combinatorics combinatorial-game-theory
asked 2 days ago
OldboyOldboy
7,1441832
asked 2 days ago
OldboyOldboy
7,1441832
asked 2 days ago
OldboyOldboy
7,1441832
asked 2 days ago
OldboyOldboy
7,1441832
asked 2 days ago
OldboyOldboy
7,1441832
7,1441832
add a comment |
add a comment |
0
active
oldest
votes
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%2f3063167%2fa-simple-game-with-n-points-in-3d-space-red-triangle-wins%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3063167%2fa-simple-game-with-n-points-in-3d-space-red-triangle-wins%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
