I have a riddle for you! I hope you enjoy!
Your team has ventured into the Amazon Forest and found the legendary treasure of 100 doubloons. Now, your team must divide the treasure according to the Adventurer’s Code (which is not legit, please do not quote me).
As head adventurer, you get to decide how to divide the coins. Your team will vote “yes” or “no” to your plan (you also count as one “yes”). If the “yes”s are equal or greater than the “no”s, then the plan goes through. Otherwise, the next adventurer in succession will decide how to divide it without you. All of your fellow adventurers will think logically as well.
There are four adventurers, Joe (you), Bob, Dan, Timmy, and Tommy.
How will you ensure that you get the most gold?
– Solution –
Think logically and backward. Let’s say it’s just Timmy and Tommy. Timmy will say “I get all of the gold” and Tommy’s one “no” won’t be able to override it, and Tommy knows this too, so he wants to avoid this.
Now, let’s go to where Dan’s head adventurer. Dan knows Tommy doesn’t want head adventurer to go to Timmy, so Dan secures Timmy’s vote with one coin.
Let’s go to Bob. Bob knows Tommy doesn’t want the vote to go to Dan, so Bob gives one coin to Tommy and nothing else.
Finally, let’s go to you. You know if head adventurer goes to Bob, Dan and Tommy will have nothing. So you give Dan and Tommy one coin each, and you keep 98. You know that Dan and Tommy know that your proposal is the best, so they begrudgingly say “yes”.
Congrats! You’ve solved the coin riddle! I hope you enjoyed!