Drawing self-improving cards: get good or remove bad first?
$begingroup$
Suppose there is a single player card game in which there is a deck of $n$ cards. A card is either red, green or blank. Initially, the deck consists of $r_0$ red, $g_0$ green and $b_0$ blank cards such that $r_0+g_0+b_0 = n$. All cards initially are put into a draw pile. If variable numbers are difficult, we may assume $n=20,r_0=9,g_0=1,b_0=10$.
Each turn, the player draws cards from his draw pile until the number of drawn red cards is equal to the number of drawn green cards plus 3 (or until there is nothing left to draw). For instance, he may draw RRR
or RGGRRRR
or BGRBRRBBR
. Each drawn card, regardless of its color, gains 1 point. The goal of the game is to score many points.
After each turn, the drawn cards are put to the side into a secondary pile. Whenever the draw pile is exhausted but the secondary pile is not empty, the secondary pile gets shuffled and put into the draw pile, such that drawing may continue. In this fashion, the deck gets recycled deterministically. (This is also how it works in the card game Dominion.)
Just before putting the drawn cards in the secondary pile, the player may, from the cards he had drawn, either pick a red card and color it blank, or a blank card and color it green. This means the cards slowly improve over time, and it may eventually be possible to draw the whole deck in single turn if enough green (or few enough red) cards exist.
The game ends after $n$ turns. The only choice the player has is his preference in coloring reds vs. blanks. I wonder about three questions:
- Which strategy should he follow to maximize the score?
- Do different strategies offer different variance?
- Do they depend on the initial color distribution?
card-games
$endgroup$
add a comment |
$begingroup$
Suppose there is a single player card game in which there is a deck of $n$ cards. A card is either red, green or blank. Initially, the deck consists of $r_0$ red, $g_0$ green and $b_0$ blank cards such that $r_0+g_0+b_0 = n$. All cards initially are put into a draw pile. If variable numbers are difficult, we may assume $n=20,r_0=9,g_0=1,b_0=10$.
Each turn, the player draws cards from his draw pile until the number of drawn red cards is equal to the number of drawn green cards plus 3 (or until there is nothing left to draw). For instance, he may draw RRR
or RGGRRRR
or BGRBRRBBR
. Each drawn card, regardless of its color, gains 1 point. The goal of the game is to score many points.
After each turn, the drawn cards are put to the side into a secondary pile. Whenever the draw pile is exhausted but the secondary pile is not empty, the secondary pile gets shuffled and put into the draw pile, such that drawing may continue. In this fashion, the deck gets recycled deterministically. (This is also how it works in the card game Dominion.)
Just before putting the drawn cards in the secondary pile, the player may, from the cards he had drawn, either pick a red card and color it blank, or a blank card and color it green. This means the cards slowly improve over time, and it may eventually be possible to draw the whole deck in single turn if enough green (or few enough red) cards exist.
The game ends after $n$ turns. The only choice the player has is his preference in coloring reds vs. blanks. I wonder about three questions:
- Which strategy should he follow to maximize the score?
- Do different strategies offer different variance?
- Do they depend on the initial color distribution?
card-games
$endgroup$
$begingroup$
I'm not sure how to tag this, please feel free to add tags.
$endgroup$
– mafu
Dec 24 '18 at 3:06
$begingroup$
"... until the number of drawn red cards is equal to ...". What happens if this never occurs?
$endgroup$
– Robert Israel
Dec 24 '18 at 3:31
$begingroup$
@RobertIsrael Then the whole draw pile (and then the secondary pile, if exists) gets drawn in a single turn, i.e. the whole deck is drawn. I've added this in the question.
$endgroup$
– mafu
Dec 24 '18 at 3:33
add a comment |
$begingroup$
Suppose there is a single player card game in which there is a deck of $n$ cards. A card is either red, green or blank. Initially, the deck consists of $r_0$ red, $g_0$ green and $b_0$ blank cards such that $r_0+g_0+b_0 = n$. All cards initially are put into a draw pile. If variable numbers are difficult, we may assume $n=20,r_0=9,g_0=1,b_0=10$.
Each turn, the player draws cards from his draw pile until the number of drawn red cards is equal to the number of drawn green cards plus 3 (or until there is nothing left to draw). For instance, he may draw RRR
or RGGRRRR
or BGRBRRBBR
. Each drawn card, regardless of its color, gains 1 point. The goal of the game is to score many points.
After each turn, the drawn cards are put to the side into a secondary pile. Whenever the draw pile is exhausted but the secondary pile is not empty, the secondary pile gets shuffled and put into the draw pile, such that drawing may continue. In this fashion, the deck gets recycled deterministically. (This is also how it works in the card game Dominion.)
Just before putting the drawn cards in the secondary pile, the player may, from the cards he had drawn, either pick a red card and color it blank, or a blank card and color it green. This means the cards slowly improve over time, and it may eventually be possible to draw the whole deck in single turn if enough green (or few enough red) cards exist.
The game ends after $n$ turns. The only choice the player has is his preference in coloring reds vs. blanks. I wonder about three questions:
- Which strategy should he follow to maximize the score?
- Do different strategies offer different variance?
- Do they depend on the initial color distribution?
card-games
$endgroup$
Suppose there is a single player card game in which there is a deck of $n$ cards. A card is either red, green or blank. Initially, the deck consists of $r_0$ red, $g_0$ green and $b_0$ blank cards such that $r_0+g_0+b_0 = n$. All cards initially are put into a draw pile. If variable numbers are difficult, we may assume $n=20,r_0=9,g_0=1,b_0=10$.
Each turn, the player draws cards from his draw pile until the number of drawn red cards is equal to the number of drawn green cards plus 3 (or until there is nothing left to draw). For instance, he may draw RRR
or RGGRRRR
or BGRBRRBBR
. Each drawn card, regardless of its color, gains 1 point. The goal of the game is to score many points.
After each turn, the drawn cards are put to the side into a secondary pile. Whenever the draw pile is exhausted but the secondary pile is not empty, the secondary pile gets shuffled and put into the draw pile, such that drawing may continue. In this fashion, the deck gets recycled deterministically. (This is also how it works in the card game Dominion.)
Just before putting the drawn cards in the secondary pile, the player may, from the cards he had drawn, either pick a red card and color it blank, or a blank card and color it green. This means the cards slowly improve over time, and it may eventually be possible to draw the whole deck in single turn if enough green (or few enough red) cards exist.
The game ends after $n$ turns. The only choice the player has is his preference in coloring reds vs. blanks. I wonder about three questions:
- Which strategy should he follow to maximize the score?
- Do different strategies offer different variance?
- Do they depend on the initial color distribution?
card-games
card-games
edited Dec 24 '18 at 3:37
mafu
asked Dec 24 '18 at 3:05
mafumafu
352117
352117
$begingroup$
I'm not sure how to tag this, please feel free to add tags.
$endgroup$
– mafu
Dec 24 '18 at 3:06
$begingroup$
"... until the number of drawn red cards is equal to ...". What happens if this never occurs?
$endgroup$
– Robert Israel
Dec 24 '18 at 3:31
$begingroup$
@RobertIsrael Then the whole draw pile (and then the secondary pile, if exists) gets drawn in a single turn, i.e. the whole deck is drawn. I've added this in the question.
$endgroup$
– mafu
Dec 24 '18 at 3:33
add a comment |
$begingroup$
I'm not sure how to tag this, please feel free to add tags.
$endgroup$
– mafu
Dec 24 '18 at 3:06
$begingroup$
"... until the number of drawn red cards is equal to ...". What happens if this never occurs?
$endgroup$
– Robert Israel
Dec 24 '18 at 3:31
$begingroup$
@RobertIsrael Then the whole draw pile (and then the secondary pile, if exists) gets drawn in a single turn, i.e. the whole deck is drawn. I've added this in the question.
$endgroup$
– mafu
Dec 24 '18 at 3:33
$begingroup$
I'm not sure how to tag this, please feel free to add tags.
$endgroup$
– mafu
Dec 24 '18 at 3:06
$begingroup$
I'm not sure how to tag this, please feel free to add tags.
$endgroup$
– mafu
Dec 24 '18 at 3:06
$begingroup$
"... until the number of drawn red cards is equal to ...". What happens if this never occurs?
$endgroup$
– Robert Israel
Dec 24 '18 at 3:31
$begingroup$
"... until the number of drawn red cards is equal to ...". What happens if this never occurs?
$endgroup$
– Robert Israel
Dec 24 '18 at 3:31
$begingroup$
@RobertIsrael Then the whole draw pile (and then the secondary pile, if exists) gets drawn in a single turn, i.e. the whole deck is drawn. I've added this in the question.
$endgroup$
– mafu
Dec 24 '18 at 3:33
$begingroup$
@RobertIsrael Then the whole draw pile (and then the secondary pile, if exists) gets drawn in a single turn, i.e. the whole deck is drawn. I've added this in the question.
$endgroup$
– mafu
Dec 24 '18 at 3:33
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%2f3050895%2fdrawing-self-improving-cards-get-good-or-remove-bad-first%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.
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%2f3050895%2fdrawing-self-improving-cards-get-good-or-remove-bad-first%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
$begingroup$
I'm not sure how to tag this, please feel free to add tags.
$endgroup$
– mafu
Dec 24 '18 at 3:06
$begingroup$
"... until the number of drawn red cards is equal to ...". What happens if this never occurs?
$endgroup$
– Robert Israel
Dec 24 '18 at 3:31
$begingroup$
@RobertIsrael Then the whole draw pile (and then the secondary pile, if exists) gets drawn in a single turn, i.e. the whole deck is drawn. I've added this in the question.
$endgroup$
– mafu
Dec 24 '18 at 3:33