From 2f7f1dcef77f337694b0d466b7254dc86e9e4b4c Mon Sep 17 00:00:00 2001 From: ChaoukiKou <90840736+ChaoukiKou@users.noreply.github.com> Date: Wed, 11 Jan 2023 14:15:27 +0100 Subject: [PATCH] Update Firstsolution.txt This is an interesting problem, and there are several ways to approach it. Here is one potential solution to the problem: Establish a rule that the first guest to put their cup in the first position gets the first cup of water, the second guest to put their cup in the second position gets the second cup of water, and so on. Make sure that all the guests understand and agree to the rule. Place a clear marking on the table to indicate the first, second, and last positions where the cups should be placed. Ask the guests to place their cups on the table in a row, according to the established rule, and remind them that the cups should be placed in the designated positions, and that only the first and last cups will be filled. Once all the cups are in place, pour water into the first and last cups, and let the guests drink from their cups. This solution is based on the idea that the guests are rational and will try to maximize their chances of getting a cup of water. By establishing a clear rule and providing a clear indication of where the cups should be placed, guests are incentivized to act honestly and to race to put their cups in the designated positions. In this situation, as you've mentioned, it's possible that some guests may try to cheat. But it's important to keep in mind that this solution is designed to be fair and maximizing the chances of getting a cup of water for everyone. It's important to mention that if you are the host, you will have to act honestly and make sure that guests abide by the rules that you've set, while trying to provide a fair solution --- solutions/Firstsolution.txt | 27 +++++++++++++++++++++++++++ 1 file changed, 27 insertions(+) diff --git a/solutions/Firstsolution.txt b/solutions/Firstsolution.txt index 8b13789..b6373a1 100644 --- a/solutions/Firstsolution.txt +++ b/solutions/Firstsolution.txt @@ -1 +1,28 @@ +The scene +On a hot day, a water outage occurred while you were feeling very thirsty. You went to the fridge to get some cold water. You were lucky enough and you found a single bottle of water left. While you were enjoying this finding and tossing your bottle in the air. Ding dong, somebody rang at the door. + +You had got N unexpected guests, all of them staring at the bottle in your hand, and suddenly shouting all once "we are thirsty". You let them in, and you all gathered in the same room around a table and everybody asked you to drink. + +Now the problem : +The bottle can only fill 3 cups. + +To overcome this problem you've ingeniously proposed a solution. You gave them each an empty cup and told them : + +”Look guys I will drink a cup and give you the 2 remaining cups of water. But, I'll fill only the first and the last cups put on the table before me. The intermediaries cups will remain empty” + +illustration + +Besides your main rule, you agreed upon the following terms: + +It's only you who can pour water (You are the host) +The cups can be filled only if all of them are put on the table. +The cups should be put in a row (the first one is the head of the row and the last is the tail). We can assume that the pourer has marked the final spots (first place, second,.. last), so each cup should be placed in one of these positions. +No timer will be used and the game doesn't have a timeout. However, if a timeout can help solve this problem you can set one (1 < x days). +It's up to you to determine who is the first depositor/winner in case they race to put the first cup (in the first position). +You will act honestly 🐧 , however the guests can behave honestly or dishonestly +A guest can drink only from his cup, but he can give his cup to another player. +The host is only responsible of pouring water. He is not to be involved in your solution. He ensures that the rules as executed as defined. +The question : In this context, how would your guests behave, if you know that they are smart and can cheat 😈 (but cannot kill each other 💀)? Would there be a good compromise (winning strategy) avoiding a deadlock? + +To make the situation more real let's assume that 2