2019 gold coins to shareFilling up 100 coins in 10 bagsThe Devil's BrotherLots of Gold Stacks and a Balance ScaleLots of Gold Golden Coins and a ScaleBest strategy to get all heads/tails from three coinsMike's Coin Duplicator99 chips into more chips99 chips into more chips V2Maximize gold bars33 stones into gold transmuter
Has there been a multiethnic Star Trek character?
Amplitude of a crest and trough in a sound wave?
Possible runaway argument using circuitikz
Why do radiation hardened IC packages often have long leads?
tabular: caption and align problem
Can we completely replace inheritance using strategy pattern and dependency injection?
What is the logic behind charging tax _in the form of money_ for owning property when the property does not produce money?
Why is Na5 not played in this line of the French Defense, Advance Variation?
2019 gold coins to share
How does the Around command at zero work?
What do the pair of vertical lines in empirical entropy formula mean?
Is it okay to have a sequel start immediately after the end of the first book?
Ability To Change Root User Password (Vulnerability?)
Who voices the small round football sized demon In Good Omens
What is the polarity of this barrel plug with a double circle?
With Ubuntu 18.04, how can I have a hot corner that locks the computer?
Proving that a Russian cryptographic standard is too structured
Should I refuse to be named as co-author of a low quality paper?
How to publish items after pipeline is finished?
Can the removal of a duty-free sales trolley result in a measurable reduction in emissions?
Write a function that checks if a string starts with or contains something
How can I remove material from this wood beam?
How creative should the DM let an artificer be in terms of what they can build?
How to safely destroy (a large quantity of) valid checks?
2019 gold coins to share
Filling up 100 coins in 10 bagsThe Devil's BrotherLots of Gold Stacks and a Balance ScaleLots of Gold Golden Coins and a ScaleBest strategy to get all heads/tails from three coinsMike's Coin Duplicator99 chips into more chips99 chips into more chips V2Maximize gold bars33 stones into gold transmuter
$begingroup$
You and your friend has found in total 2019 gold coins in a treasure hunt. Since your friend found to place to dig up, you offer a game to share the coins to him:
"We have 2019 coins, I will put as many of the coins as I want into a bag and you will see how many coins I place inside. Every time I have finished putting coins into a bag, you will (based on the number of coins in the bag) determine whether or not you want that bag. If you don't want that bag, I will take it. Then I will start putting coins into another bag and so on...
After one of us has 13 bags in total, we will stop playing the game, and the rest of the coins will be given to whomever doesn't have 13 bags."
Your friend likes the game and accept the offer. He thinks this is a fair game to share the coins.
At least how many gold coins can you guarantee to win at the end of this game?
for example: you put 50 coins in the first bag then your friend decides not to take that bag, after that you decide to put 100 coins into another bag, this time your friend decides to take that bag... etc.
mathematics strategy optimization game-theory
edited 7 hours ago
Brandon_J
4,729551
asked 8 hours ago
OrayOray
16.5k438164
$endgroup$
add a comment |
$begingroup$
You and your friend has found in total 2019 gold coins in a treasure hunt. Since your friend found to place to dig up, you offer a game to share the coins to him:
"We have 2019 coins, I will put as many of the coins as I want into a bag and you will see how many coins I place inside. Every time I have finished putting coins into a bag, you will (based on the number of coins in the bag) determine whether or not you want that bag. If you don't want that bag, I will take it. Then I will start putting coins into another bag and so on...
After one of us has 13 bags in total, we will stop playing the game, and the rest of the coins will be given to whomever doesn't have 13 bags."
Your friend likes the game and accept the offer. He thinks this is a fair game to share the coins.
At least how many gold coins can you guarantee to win at the end of this game?
for example: you put 50 coins in the first bag then your friend decides not to take that bag, after that you decide to put 100 coins into another bag, this time your friend decides to take that bag... etc.
mathematics strategy optimization game-theory
edited 7 hours ago
Brandon_J
4,729551
asked 8 hours ago
OrayOray
16.5k438164
$endgroup$
$begingroup$
I find the wording a bit confusing, could you clarify a couple of things: 1: Do I fill the bags one-by-one or all at once? 2: Do you get to know in advance how many coins I'm going to put into each bag? 3: If more than one bag is getting filled at the same time, which one of them do you get to choose for you or me? 4: How does the "knowing how many golds inside" thing affect the result? You saw every coin that was put into the bags, so you know exactly how many coins there are.
$endgroup$
– Bass
7 hours ago
$begingroup$
@bass 1: one by one, 2: yes i said in the text actually everybody knows how many coins in each bag,
$endgroup$
– Oray
7 hours ago
$begingroup$
Why was this downvoted? Seems like a nice puzzle to me...Perhaps it was because the wording was a little confusing? I'll try an edit.
$endgroup$
– Brandon_J
7 hours ago
add a comment |
$begingroup$
You and your friend has found in total 2019 gold coins in a treasure hunt. Since your friend found to place to dig up, you offer a game to share the coins to him:
"We have 2019 coins, I will put as many of the coins as I want into a bag and you will see how many coins I place inside. Every time I have finished putting coins into a bag, you will (based on the number of coins in the bag) determine whether or not you want that bag. If you don't want that bag, I will take it. Then I will start putting coins into another bag and so on...
After one of us has 13 bags in total, we will stop playing the game, and the rest of the coins will be given to whomever doesn't have 13 bags."
Your friend likes the game and accept the offer. He thinks this is a fair game to share the coins.
At least how many gold coins can you guarantee to win at the end of this game?
for example: you put 50 coins in the first bag then your friend decides not to take that bag, after that you decide to put 100 coins into another bag, this time your friend decides to take that bag... etc.
mathematics strategy optimization game-theory
edited 7 hours ago
Brandon_J
4,729551
asked 8 hours ago
OrayOray
16.5k438164
$endgroup$
You and your friend has found in total 2019 gold coins in a treasure hunt. Since your friend found to place to dig up, you offer a game to share the coins to him:
"We have 2019 coins, I will put as many of the coins as I want into a bag and you will see how many coins I place inside. Every time I have finished putting coins into a bag, you will (based on the number of coins in the bag) determine whether or not you want that bag. If you don't want that bag, I will take it. Then I will start putting coins into another bag and so on...
After one of us has 13 bags in total, we will stop playing the game, and the rest of the coins will be given to whomever doesn't have 13 bags."
Your friend likes the game and accept the offer. He thinks this is a fair game to share the coins.
At least how many gold coins can you guarantee to win at the end of this game?
for example: you put 50 coins in the first bag then your friend decides not to take that bag, after that you decide to put 100 coins into another bag, this time your friend decides to take that bag... etc.
mathematics strategy optimization game-theory
mathematics strategy optimization game-theory
edited 7 hours ago
Brandon_J
4,729551
asked 8 hours ago
OrayOray
16.5k438164
edited 7 hours ago
Brandon_J
4,729551
asked 8 hours ago
OrayOray
16.5k438164
edited 7 hours ago
Brandon_J
4,729551
edited 7 hours ago
Brandon_J
4,729551
edited 7 hours ago
Brandon_J
4,729551
4,729551
asked 8 hours ago
OrayOray
16.5k438164
asked 8 hours ago
OrayOray
16.5k438164
asked 8 hours ago
OrayOray
16.5k438164
16.5k438164
$begingroup$
I find the wording a bit confusing, could you clarify a couple of things: 1: Do I fill the bags one-by-one or all at once? 2: Do you get to know in advance how many coins I'm going to put into each bag? 3: If more than one bag is getting filled at the same time, which one of them do you get to choose for you or me? 4: How does the "knowing how many golds inside" thing affect the result? You saw every coin that was put into the bags, so you know exactly how many coins there are.
$endgroup$
– Bass
7 hours ago
$begingroup$
@bass 1: one by one, 2: yes i said in the text actually everybody knows how many coins in each bag,
$endgroup$
– Oray
7 hours ago
$begingroup$
Why was this downvoted? Seems like a nice puzzle to me...Perhaps it was because the wording was a little confusing? I'll try an edit.
$endgroup$
– Brandon_J
7 hours ago
add a comment |
$begingroup$
I find the wording a bit confusing, could you clarify a couple of things: 1: Do I fill the bags one-by-one or all at once? 2: Do you get to know in advance how many coins I'm going to put into each bag? 3: If more than one bag is getting filled at the same time, which one of them do you get to choose for you or me? 4: How does the "knowing how many golds inside" thing affect the result? You saw every coin that was put into the bags, so you know exactly how many coins there are.
$endgroup$
– Bass
7 hours ago
$begingroup$
@bass 1: one by one, 2: yes i said in the text actually everybody knows how many coins in each bag,
$endgroup$
– Oray
7 hours ago
$begingroup$
Why was this downvoted? Seems like a nice puzzle to me...Perhaps it was because the wording was a little confusing? I'll try an edit.
$endgroup$
– Brandon_J
7 hours ago
$begingroup$
I find the wording a bit confusing, could you clarify a couple of things: 1: Do I fill the bags one-by-one or all at once? 2: Do you get to know in advance how many coins I'm going to put into each bag? 3: If more than one bag is getting filled at the same time, which one of them do you get to choose for you or me? 4: How does the "knowing how many golds inside" thing affect the result? You saw every coin that was put into the bags, so you know exactly how many coins there are.
$endgroup$
– Bass
7 hours ago
$begingroup$
I find the wording a bit confusing, could you clarify a couple of things: 1: Do I fill the bags one-by-one or all at once? 2: Do you get to know in advance how many coins I'm going to put into each bag? 3: If more than one bag is getting filled at the same time, which one of them do you get to choose for you or me? 4: How does the "knowing how many golds inside" thing affect the result? You saw every coin that was put into the bags, so you know exactly how many coins there are.
$endgroup$
– Bass
7 hours ago
$begingroup$
@bass 1: one by one, 2: yes i said in the text actually everybody knows how many coins in each bag,
$endgroup$
– Oray
7 hours ago
$begingroup$
@bass 1: one by one, 2: yes i said in the text actually everybody knows how many coins in each bag,
$endgroup$
– Oray
7 hours ago
$begingroup$
Why was this downvoted? Seems like a nice puzzle to me...Perhaps it was because the wording was a little confusing? I'll try an edit.
$endgroup$
– Brandon_J
7 hours ago
$begingroup$
Why was this downvoted? Seems like a nice puzzle to me...Perhaps it was because the wording was a little confusing? I'll try an edit.
$endgroup$
– Brandon_J
7 hours ago
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
I can ensure that I receive at least
1005 coins.
To get this amount of coins, I could apply the following strategy:
I put 78 coins in each bag. Now if I get 13 bags earlier than my friend, then I have $13 cdot 78 = 1014$ coins,. If my friend however takes 13 bags, then he has 1014 coins, and I get the 1005 remaining coins.
My friend can also ensure that I do not get more coins than this in the following way:
He can take any bag with at least 78 coins, and return any bag with at most 77 coins. Now if I get 13 bags earlier than him, this means that I get at most $13 cdot 77 = 1001$ coins. But if he get 13 bags earlier than me, he gets at least $13 cdot 78 = 1014$ coins, and I get at most $2019-1014 = 1005$ coins.
So it appears that I should have chosen a fairer game to distribute the coins...
answered 7 hours ago
ReinierReinier
2,550819
$endgroup$
$begingroup$
Looks like we arrived at the same conclusion, but in slightly different ways. You did get there first, of course, so congrats!
$endgroup$
– Brandon_J
7 hours ago
$begingroup$
@Brandon_J I found the threshold in the friends strategy by dividing by 26 instead of 25, since he wants to get at least half of the coins when he takes 13 of the bags.
$endgroup$
– Reinier
7 hours ago
$begingroup$
Ah - that explains why you got there faster.
$endgroup$
– Brandon_J
7 hours ago
$begingroup$
You can actually generalize this approach to work for $n$ coins and stopping at $k$ bags: then we put $fracn2k$ coins rounded to the nearest integer in each bag, and our friend only takes bags with at least $fracn2k$ coins.
$endgroup$
– Reinier
7 hours ago
add a comment |
$begingroup$
A note: @Reinier, besides having an awesome palindromic username, also solved this puzzle first (my solve was still independent). I like my explanation better (but of course I'm biased), but if you upvote my answer, don't forget to upvote Reinier's as well.
So, it's somewhat apparent that we need to find
the optimal strategy (for us) in the worst-case scenario (our friend tries to get as many coins as he can).
Here's my basic strategy:
The maximum number of bags that may be filled is 25. This is because the game ends when one person gains 13 bags. Consequently, if we divide all the coins equally among the bags, then the worst we can get is 12/25 of the loot. Of course, we can't quite divide them equally, so we will fill 6 of them with 80 coins, and 19 of them with 81 coins.
When we present each bag to our friend,
The best-case scenario for him/her is to gather 13 of the 19 81-coin bags. This leaves us with $81 * 6 + 80 *6 = 966$ coins to his $31 * 81 = 1,053$.
Essentially, the friend's strategy is to
keep any bag with more than 80 coins, and give us any bag with 80 coins or less.
There is, of course, a slight work-around that can get us a liiiitle bit more.
If we present a continual stream of
80-coin bags, then the friend's best bet is to give us the first 12 bags, but then give himself the rest of the bags. This improves things a little bit - our friend only gets $1,040$ coins, and we get $979$.
What if we present a continual stream of
79-coin bags? The best our friend can get is $1,027$, and we get $998$ That's even better!
What if we present a continual stream of
78-coin bags? The best our friend can get is $1,014$, and we get $1,005$ That's even better!
What if we present a continual stream of
77-coin bags? The best our friend can get is $1,024$, and this is if he gives us all 13 of the 77-coin bags. Previously, he ended up giving himself all of the bags, so it looks like the highest point we can reach is with 78-coin bags.
So, the altered strategy of our friend is to
keep any bag with more than 77 coins. $13*78$ coins gives him a majority of the coins, while $13*77$ coins gives him a minority of the coins.
We can infer that we can do no better than
78-coin bags
because
Every bag must be above, below, or at 78 coins. If we present to our friend bags with less than 78 coins, he gives them to us, and we're playing a non-optimal strategy. If we present him with more, he goes ahead and takes it, increasing his potential winnings.
answered 7 hours ago
Brandon_JBrandon_J
4,729551
$endgroup$
add a comment |
Your Answer
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
);
);
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%2f84823%2f2019-gold-coins-to-share%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
I can ensure that I receive at least
1005 coins.
To get this amount of coins, I could apply the following strategy:
I put 78 coins in each bag. Now if I get 13 bags earlier than my friend, then I have $13 cdot 78 = 1014$ coins,. If my friend however takes 13 bags, then he has 1014 coins, and I get the 1005 remaining coins.
My friend can also ensure that I do not get more coins than this in the following way:
He can take any bag with at least 78 coins, and return any bag with at most 77 coins. Now if I get 13 bags earlier than him, this means that I get at most $13 cdot 77 = 1001$ coins. But if he get 13 bags earlier than me, he gets at least $13 cdot 78 = 1014$ coins, and I get at most $2019-1014 = 1005$ coins.
So it appears that I should have chosen a fairer game to distribute the coins...
answered 7 hours ago
ReinierReinier
2,550819
$endgroup$
$begingroup$
Looks like we arrived at the same conclusion, but in slightly different ways. You did get there first, of course, so congrats!
$endgroup$
– Brandon_J
7 hours ago
$begingroup$
@Brandon_J I found the threshold in the friends strategy by dividing by 26 instead of 25, since he wants to get at least half of the coins when he takes 13 of the bags.
$endgroup$
– Reinier
7 hours ago
$begingroup$
Ah - that explains why you got there faster.
$endgroup$
– Brandon_J
7 hours ago
$begingroup$
You can actually generalize this approach to work for $n$ coins and stopping at $k$ bags: then we put $fracn2k$ coins rounded to the nearest integer in each bag, and our friend only takes bags with at least $fracn2k$ coins.
$endgroup$
– Reinier
7 hours ago
add a comment |
$begingroup$
I can ensure that I receive at least
1005 coins.
To get this amount of coins, I could apply the following strategy:
I put 78 coins in each bag. Now if I get 13 bags earlier than my friend, then I have $13 cdot 78 = 1014$ coins,. If my friend however takes 13 bags, then he has 1014 coins, and I get the 1005 remaining coins.
My friend can also ensure that I do not get more coins than this in the following way:
He can take any bag with at least 78 coins, and return any bag with at most 77 coins. Now if I get 13 bags earlier than him, this means that I get at most $13 cdot 77 = 1001$ coins. But if he get 13 bags earlier than me, he gets at least $13 cdot 78 = 1014$ coins, and I get at most $2019-1014 = 1005$ coins.
So it appears that I should have chosen a fairer game to distribute the coins...
answered 7 hours ago
ReinierReinier
2,550819
$endgroup$
$begingroup$
Looks like we arrived at the same conclusion, but in slightly different ways. You did get there first, of course, so congrats!
$endgroup$
– Brandon_J
7 hours ago
$begingroup$
@Brandon_J I found the threshold in the friends strategy by dividing by 26 instead of 25, since he wants to get at least half of the coins when he takes 13 of the bags.
$endgroup$
– Reinier
7 hours ago
$begingroup$
Ah - that explains why you got there faster.
$endgroup$
– Brandon_J
7 hours ago
$begingroup$
You can actually generalize this approach to work for $n$ coins and stopping at $k$ bags: then we put $fracn2k$ coins rounded to the nearest integer in each bag, and our friend only takes bags with at least $fracn2k$ coins.
$endgroup$
– Reinier
7 hours ago
add a comment |
$begingroup$
I can ensure that I receive at least
1005 coins.
To get this amount of coins, I could apply the following strategy:
I put 78 coins in each bag. Now if I get 13 bags earlier than my friend, then I have $13 cdot 78 = 1014$ coins,. If my friend however takes 13 bags, then he has 1014 coins, and I get the 1005 remaining coins.
My friend can also ensure that I do not get more coins than this in the following way:
He can take any bag with at least 78 coins, and return any bag with at most 77 coins. Now if I get 13 bags earlier than him, this means that I get at most $13 cdot 77 = 1001$ coins. But if he get 13 bags earlier than me, he gets at least $13 cdot 78 = 1014$ coins, and I get at most $2019-1014 = 1005$ coins.
So it appears that I should have chosen a fairer game to distribute the coins...
answered 7 hours ago
ReinierReinier
2,550819
$endgroup$
I can ensure that I receive at least
1005 coins.
To get this amount of coins, I could apply the following strategy:
I put 78 coins in each bag. Now if I get 13 bags earlier than my friend, then I have $13 cdot 78 = 1014$ coins,. If my friend however takes 13 bags, then he has 1014 coins, and I get the 1005 remaining coins.
My friend can also ensure that I do not get more coins than this in the following way:
He can take any bag with at least 78 coins, and return any bag with at most 77 coins. Now if I get 13 bags earlier than him, this means that I get at most $13 cdot 77 = 1001$ coins. But if he get 13 bags earlier than me, he gets at least $13 cdot 78 = 1014$ coins, and I get at most $2019-1014 = 1005$ coins.
So it appears that I should have chosen a fairer game to distribute the coins...
answered 7 hours ago
ReinierReinier
2,550819
answered 7 hours ago
ReinierReinier
2,550819
answered 7 hours ago
ReinierReinier
2,550819
answered 7 hours ago
ReinierReinier
2,550819
2,550819
$begingroup$
Looks like we arrived at the same conclusion, but in slightly different ways. You did get there first, of course, so congrats!
$endgroup$
– Brandon_J
7 hours ago
$begingroup$
@Brandon_J I found the threshold in the friends strategy by dividing by 26 instead of 25, since he wants to get at least half of the coins when he takes 13 of the bags.
$endgroup$
– Reinier
7 hours ago
$begingroup$
Ah - that explains why you got there faster.
$endgroup$
– Brandon_J
7 hours ago
$begingroup$
You can actually generalize this approach to work for $n$ coins and stopping at $k$ bags: then we put $fracn2k$ coins rounded to the nearest integer in each bag, and our friend only takes bags with at least $fracn2k$ coins.
$endgroup$
– Reinier
7 hours ago
add a comment |
$begingroup$
Looks like we arrived at the same conclusion, but in slightly different ways. You did get there first, of course, so congrats!
$endgroup$
– Brandon_J
7 hours ago
$begingroup$
@Brandon_J I found the threshold in the friends strategy by dividing by 26 instead of 25, since he wants to get at least half of the coins when he takes 13 of the bags.
$endgroup$
– Reinier
7 hours ago
$begingroup$
Ah - that explains why you got there faster.
$endgroup$
– Brandon_J
7 hours ago
$begingroup$
You can actually generalize this approach to work for $n$ coins and stopping at $k$ bags: then we put $fracn2k$ coins rounded to the nearest integer in each bag, and our friend only takes bags with at least $fracn2k$ coins.
$endgroup$
– Reinier
7 hours ago
$begingroup$
Looks like we arrived at the same conclusion, but in slightly different ways. You did get there first, of course, so congrats!
$endgroup$
– Brandon_J
7 hours ago
$begingroup$
Looks like we arrived at the same conclusion, but in slightly different ways. You did get there first, of course, so congrats!
$endgroup$
– Brandon_J
7 hours ago
$begingroup$
@Brandon_J I found the threshold in the friends strategy by dividing by 26 instead of 25, since he wants to get at least half of the coins when he takes 13 of the bags.
$endgroup$
– Reinier
7 hours ago
$begingroup$
@Brandon_J I found the threshold in the friends strategy by dividing by 26 instead of 25, since he wants to get at least half of the coins when he takes 13 of the bags.
$endgroup$
– Reinier
7 hours ago
$begingroup$
Ah - that explains why you got there faster.
$endgroup$
– Brandon_J
7 hours ago
$begingroup$
Ah - that explains why you got there faster.
$endgroup$
– Brandon_J
7 hours ago
$begingroup$
You can actually generalize this approach to work for $n$ coins and stopping at $k$ bags: then we put $fracn2k$ coins rounded to the nearest integer in each bag, and our friend only takes bags with at least $fracn2k$ coins.
$endgroup$
– Reinier
7 hours ago
$begingroup$
You can actually generalize this approach to work for $n$ coins and stopping at $k$ bags: then we put $fracn2k$ coins rounded to the nearest integer in each bag, and our friend only takes bags with at least $fracn2k$ coins.
$endgroup$
– Reinier
7 hours ago
add a comment |
$begingroup$
A note: @Reinier, besides having an awesome palindromic username, also solved this puzzle first (my solve was still independent). I like my explanation better (but of course I'm biased), but if you upvote my answer, don't forget to upvote Reinier's as well.
So, it's somewhat apparent that we need to find
the optimal strategy (for us) in the worst-case scenario (our friend tries to get as many coins as he can).
Here's my basic strategy:
The maximum number of bags that may be filled is 25. This is because the game ends when one person gains 13 bags. Consequently, if we divide all the coins equally among the bags, then the worst we can get is 12/25 of the loot. Of course, we can't quite divide them equally, so we will fill 6 of them with 80 coins, and 19 of them with 81 coins.
When we present each bag to our friend,
The best-case scenario for him/her is to gather 13 of the 19 81-coin bags. This leaves us with $81 * 6 + 80 *6 = 966$ coins to his $31 * 81 = 1,053$.
Essentially, the friend's strategy is to
keep any bag with more than 80 coins, and give us any bag with 80 coins or less.
There is, of course, a slight work-around that can get us a liiiitle bit more.
If we present a continual stream of
80-coin bags, then the friend's best bet is to give us the first 12 bags, but then give himself the rest of the bags. This improves things a little bit - our friend only gets $1,040$ coins, and we get $979$.
What if we present a continual stream of
79-coin bags? The best our friend can get is $1,027$, and we get $998$ That's even better!
What if we present a continual stream of
78-coin bags? The best our friend can get is $1,014$, and we get $1,005$ That's even better!
What if we present a continual stream of
77-coin bags? The best our friend can get is $1,024$, and this is if he gives us all 13 of the 77-coin bags. Previously, he ended up giving himself all of the bags, so it looks like the highest point we can reach is with 78-coin bags.
So, the altered strategy of our friend is to
keep any bag with more than 77 coins. $13*78$ coins gives him a majority of the coins, while $13*77$ coins gives him a minority of the coins.
We can infer that we can do no better than
78-coin bags
because
Every bag must be above, below, or at 78 coins. If we present to our friend bags with less than 78 coins, he gives them to us, and we're playing a non-optimal strategy. If we present him with more, he goes ahead and takes it, increasing his potential winnings.
answered 7 hours ago
Brandon_JBrandon_J
4,729551
$endgroup$
add a comment |
$begingroup$
A note: @Reinier, besides having an awesome palindromic username, also solved this puzzle first (my solve was still independent). I like my explanation better (but of course I'm biased), but if you upvote my answer, don't forget to upvote Reinier's as well.
So, it's somewhat apparent that we need to find
the optimal strategy (for us) in the worst-case scenario (our friend tries to get as many coins as he can).
Here's my basic strategy:
The maximum number of bags that may be filled is 25. This is because the game ends when one person gains 13 bags. Consequently, if we divide all the coins equally among the bags, then the worst we can get is 12/25 of the loot. Of course, we can't quite divide them equally, so we will fill 6 of them with 80 coins, and 19 of them with 81 coins.
When we present each bag to our friend,
The best-case scenario for him/her is to gather 13 of the 19 81-coin bags. This leaves us with $81 * 6 + 80 *6 = 966$ coins to his $31 * 81 = 1,053$.
Essentially, the friend's strategy is to
keep any bag with more than 80 coins, and give us any bag with 80 coins or less.
There is, of course, a slight work-around that can get us a liiiitle bit more.
If we present a continual stream of
80-coin bags, then the friend's best bet is to give us the first 12 bags, but then give himself the rest of the bags. This improves things a little bit - our friend only gets $1,040$ coins, and we get $979$.
What if we present a continual stream of
79-coin bags? The best our friend can get is $1,027$, and we get $998$ That's even better!
What if we present a continual stream of
78-coin bags? The best our friend can get is $1,014$, and we get $1,005$ That's even better!
What if we present a continual stream of
77-coin bags? The best our friend can get is $1,024$, and this is if he gives us all 13 of the 77-coin bags. Previously, he ended up giving himself all of the bags, so it looks like the highest point we can reach is with 78-coin bags.
So, the altered strategy of our friend is to
keep any bag with more than 77 coins. $13*78$ coins gives him a majority of the coins, while $13*77$ coins gives him a minority of the coins.
We can infer that we can do no better than
78-coin bags
because
Every bag must be above, below, or at 78 coins. If we present to our friend bags with less than 78 coins, he gives them to us, and we're playing a non-optimal strategy. If we present him with more, he goes ahead and takes it, increasing his potential winnings.
answered 7 hours ago
Brandon_JBrandon_J
4,729551
$endgroup$
add a comment |
$begingroup$
A note: @Reinier, besides having an awesome palindromic username, also solved this puzzle first (my solve was still independent). I like my explanation better (but of course I'm biased), but if you upvote my answer, don't forget to upvote Reinier's as well.
So, it's somewhat apparent that we need to find
the optimal strategy (for us) in the worst-case scenario (our friend tries to get as many coins as he can).
Here's my basic strategy:
The maximum number of bags that may be filled is 25. This is because the game ends when one person gains 13 bags. Consequently, if we divide all the coins equally among the bags, then the worst we can get is 12/25 of the loot. Of course, we can't quite divide them equally, so we will fill 6 of them with 80 coins, and 19 of them with 81 coins.
When we present each bag to our friend,
The best-case scenario for him/her is to gather 13 of the 19 81-coin bags. This leaves us with $81 * 6 + 80 *6 = 966$ coins to his $31 * 81 = 1,053$.
Essentially, the friend's strategy is to
keep any bag with more than 80 coins, and give us any bag with 80 coins or less.
There is, of course, a slight work-around that can get us a liiiitle bit more.
If we present a continual stream of
80-coin bags, then the friend's best bet is to give us the first 12 bags, but then give himself the rest of the bags. This improves things a little bit - our friend only gets $1,040$ coins, and we get $979$.
What if we present a continual stream of
79-coin bags? The best our friend can get is $1,027$, and we get $998$ That's even better!
What if we present a continual stream of
78-coin bags? The best our friend can get is $1,014$, and we get $1,005$ That's even better!
What if we present a continual stream of
77-coin bags? The best our friend can get is $1,024$, and this is if he gives us all 13 of the 77-coin bags. Previously, he ended up giving himself all of the bags, so it looks like the highest point we can reach is with 78-coin bags.
So, the altered strategy of our friend is to
keep any bag with more than 77 coins. $13*78$ coins gives him a majority of the coins, while $13*77$ coins gives him a minority of the coins.
We can infer that we can do no better than
78-coin bags
because
Every bag must be above, below, or at 78 coins. If we present to our friend bags with less than 78 coins, he gives them to us, and we're playing a non-optimal strategy. If we present him with more, he goes ahead and takes it, increasing his potential winnings.
answered 7 hours ago
Brandon_JBrandon_J
4,729551
$endgroup$
A note: @Reinier, besides having an awesome palindromic username, also solved this puzzle first (my solve was still independent). I like my explanation better (but of course I'm biased), but if you upvote my answer, don't forget to upvote Reinier's as well.
So, it's somewhat apparent that we need to find
the optimal strategy (for us) in the worst-case scenario (our friend tries to get as many coins as he can).
Here's my basic strategy:
The maximum number of bags that may be filled is 25. This is because the game ends when one person gains 13 bags. Consequently, if we divide all the coins equally among the bags, then the worst we can get is 12/25 of the loot. Of course, we can't quite divide them equally, so we will fill 6 of them with 80 coins, and 19 of them with 81 coins.
When we present each bag to our friend,
The best-case scenario for him/her is to gather 13 of the 19 81-coin bags. This leaves us with $81 * 6 + 80 *6 = 966$ coins to his $31 * 81 = 1,053$.
Essentially, the friend's strategy is to
keep any bag with more than 80 coins, and give us any bag with 80 coins or less.
There is, of course, a slight work-around that can get us a liiiitle bit more.
If we present a continual stream of
80-coin bags, then the friend's best bet is to give us the first 12 bags, but then give himself the rest of the bags. This improves things a little bit - our friend only gets $1,040$ coins, and we get $979$.
What if we present a continual stream of
79-coin bags? The best our friend can get is $1,027$, and we get $998$ That's even better!
What if we present a continual stream of
78-coin bags? The best our friend can get is $1,014$, and we get $1,005$ That's even better!
What if we present a continual stream of
77-coin bags? The best our friend can get is $1,024$, and this is if he gives us all 13 of the 77-coin bags. Previously, he ended up giving himself all of the bags, so it looks like the highest point we can reach is with 78-coin bags.
So, the altered strategy of our friend is to
keep any bag with more than 77 coins. $13*78$ coins gives him a majority of the coins, while $13*77$ coins gives him a minority of the coins.
We can infer that we can do no better than
78-coin bags
because
Every bag must be above, below, or at 78 coins. If we present to our friend bags with less than 78 coins, he gives them to us, and we're playing a non-optimal strategy. If we present him with more, he goes ahead and takes it, increasing his potential winnings.
answered 7 hours ago
Brandon_JBrandon_J
4,729551
edited 7 hours ago
answered 7 hours ago
Brandon_JBrandon_J
4,729551
answered 7 hours ago
Brandon_JBrandon_J
4,729551
answered 7 hours ago
Brandon_JBrandon_J
4,729551
4,729551
add a comment |
add a comment |
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%2f84823%2f2019-gold-coins-to-share%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 find the wording a bit confusing, could you clarify a couple of things: 1: Do I fill the bags one-by-one or all at once? 2: Do you get to know in advance how many coins I'm going to put into each bag? 3: If more than one bag is getting filled at the same time, which one of them do you get to choose for you or me? 4: How does the "knowing how many golds inside" thing affect the result? You saw every coin that was put into the bags, so you know exactly how many coins there are.
$endgroup$
– Bass
7 hours ago
$begingroup$
@bass 1: one by one, 2: yes i said in the text actually everybody knows how many coins in each bag,
$endgroup$
– Oray
7 hours ago
$begingroup$
Why was this downvoted? Seems like a nice puzzle to me...Perhaps it was because the wording was a little confusing? I'll try an edit.
$endgroup$
– Brandon_J
7 hours ago