create account

Logic Problem #1 - Gnomes and Party Hats by teddyp

View this thread on: hive.blogpeakd.comecency.com
· @teddyp · (edited)
$0.11
Logic Problem #1 - Gnomes and Party Hats
There are ten gnomes who have gotten themselves into a fair bit of trouble. They are trapped in the dungeon of an evil king who likes to play games with his prisoners. The king tells them the first game he will play with them, it goes like this:

The king lines the gnomes up in a single-file row. Meaning that the tenth gnome sees the back of the person in front of him, and there is no gnome behind the tenth gnome. The ninth gnome has the tenth gnome behind him and the eighth gnome directly in front of him, and so on.  Finally, the first gnome has the second gnome directly behind him, and there is no one in front of the first gnome.  

For some reason or another, the king has a bag full of black and white party hats. The king randomly reaches into his bag and places a party hat on each of the gnomes' heads. This means that the tenth gnome can see everyone's hat except his own, the ninth gnome can see everyone's hat except his own and the tenth gnome's hat, and so on. The first gnome can see no one's hat. Now, it is important to note that there is not necessarily the same number of black party hats as white party hats.

Once he has placed party hats on all the gnomes, the king will then takes out his gun and put it to the temple of the tenth gnome. The king will ask the gnome: "What color is your party hat?" If the gnome answers correctly, he lives and gets freed from the dungeon. If he does not, he dies. The king continues up the line in this progression until he reaches the last gnome.

Despite his evilness, the king has a silver lining in his heart. So, he has given the gnomes a chance to live. His offer is this: 

*"Before I place the party hats on you, you are allowed to meet as a group and discuss a strategy to save as many of each other as possible."*

Imagine that you are one of these gnomes. What strategy would you develop? How many gnomes can you guarantee to save?  

***When it is your turn to say the color of your hat you must ONLY say "white" or "black."  If you say anything else, the king will shoot you and all of the remaining gnomes.***

This puzzle was told to me by a legend of the Bates Math Department, Eric Towne.

![Screen Shot 2017-07-07 at 2.32.04 PM.png](https://steemitimages.com/DQmQNvfSUkzM43ahu6JZ8aqWCuLrhyrXD5aVPHPxBYMMYJh/Screen%20Shot%202017-07-07%20at%202.32.04%20PM.png)
👍  , ,
properties (23)
authorteddyp
permlinklogic-problem-1-gnomes-and-party-hats
categorypuzzle
json_metadata{"tags":["puzzle","blog","writing","science","logic"],"image":["https://steemitimages.com/DQmQNvfSUkzM43ahu6JZ8aqWCuLrhyrXD5aVPHPxBYMMYJh/Screen%20Shot%202017-07-07%20at%202.32.04%20PM.png"],"app":"steemit/0.1","format":"markdown"}
created2017-07-07 18:31:42
last_update2017-07-07 18:34:06
depth0
children3
last_payout2017-07-14 18:31:42
cashout_time1969-12-31 23:59:59
total_payout_value0.104 HBD
curator_payout_value0.008 HBD
pending_payout_value0.000 HBD
promoted0.000 HBD
body_length2,339
author_reputation63,692,667,713
root_title"Logic Problem #1 - Gnomes and Party Hats"
beneficiaries[]
max_accepted_payout1,000,000.000 HBD
percent_hbd10,000
post_id7,673,381
net_rshares25,464,147,658
author_curate_reward""
vote details (3)
@e-saber · (edited)
$0.05
I know the answer, but only because I too know the Bates Mathematics Legend, Eric Towne
👍  
properties (23)
authore-saber
permlinkre-teddyp-logic-problem-1-gnomes-and-party-hats-20170707t194401626z
categorypuzzle
json_metadata{"tags":["puzzle"],"app":"steemit/0.1"}
created2017-07-07 19:44:00
last_update2017-07-07 19:44:24
depth1
children1
last_payout2017-07-14 19:44:00
cashout_time1969-12-31 23:59:59
total_payout_value0.037 HBD
curator_payout_value0.011 HBD
pending_payout_value0.000 HBD
promoted0.000 HBD
body_length87
author_reputation1,236,429,476,271
root_title"Logic Problem #1 - Gnomes and Party Hats"
beneficiaries[]
max_accepted_payout1,000,000.000 HBD
percent_hbd10,000
post_id7,680,209
net_rshares11,359,327,984
author_curate_reward""
vote details (1)
@e-saber ·
$0.05
So I won't give it away
👍  
properties (23)
authore-saber
permlinkre-e-saber-re-teddyp-logic-problem-1-gnomes-and-party-hats-20170707t194431539z
categorypuzzle
json_metadata{"tags":["puzzle"],"app":"steemit/0.1"}
created2017-07-07 19:44:30
last_update2017-07-07 19:44:30
depth2
children0
last_payout2017-07-14 19:44:30
cashout_time1969-12-31 23:59:59
total_payout_value0.036 HBD
curator_payout_value0.011 HBD
pending_payout_value0.000 HBD
promoted0.000 HBD
body_length23
author_reputation1,236,429,476,271
root_title"Logic Problem #1 - Gnomes and Party Hats"
beneficiaries[]
max_accepted_payout1,000,000.000 HBD
percent_hbd10,000
post_id7,680,258
net_rshares11,132,141,424
author_curate_reward""
vote details (1)
@sidekickguy ·
The easiest way to save everybody would be for each gnome to take the party hat of the gnome in front and place it on their respective heads.  This way, gnomes 2-10 would know their hat's color. 

Once gnome number 10 finishes his turn, we know he "lives", and is is "freed". Gnome 10 doesn't need the party hat anymore, so he gives it to gnome 1 on his way out. All gnome 1 has to do is listen to what gnome 10 says.
properties (22)
authorsidekickguy
permlinkre-teddyp-logic-problem-1-gnomes-and-party-hats-20170708t021514817z
categorypuzzle
json_metadata{"tags":["puzzle"],"app":"steemit/0.1"}
created2017-07-08 02:15:06
last_update2017-07-08 02:15:06
depth1
children0
last_payout2017-07-15 02:15:06
cashout_time1969-12-31 23:59:59
total_payout_value0.000 HBD
curator_payout_value0.000 HBD
pending_payout_value0.000 HBD
promoted0.000 HBD
body_length417
author_reputation6,641,765,755
root_title"Logic Problem #1 - Gnomes and Party Hats"
beneficiaries[]
max_accepted_payout1,000,000.000 HBD
percent_hbd10,000
post_id7,708,431
net_rshares0