2014 people and 2015 hats

Day 2,438, 13:19 Published in Saudi Arabia Saudi Arabia by I-G-D

Hey, everyone.

Since I’m bored, I’ve decided to write an article about a cool logical problem that I know. I might have mentioned it to some of you, but I don’t remember revealing the solution to anyone but a few people, so I think it will be a cool idea to share it with the others, via article.

So, this is the problem:

You have a team of 2014 people, and they are arranged in a column, with #1 facing everyone and #2014 facing no one. There are 2015 hats, numbered from 1 to 2015. The game goes like this: one of the hats gets hidden, and the remaining 2014 hats are put on the 2014 people, one hat per person. However, nobody can see the number on their own hat.

Each person can see the numbers on the hats of ALL the people sat in front of them. This means that person #1 sees everyone’s hat number except his own, person #2 sees everyone’s hat number except his own and person #1’s, etc. The people don’t know which hat is hidden.

After the hats are handed out, everyone must try to guess their hat number by saying one number from 1 to 2015. The person at the back of the column starts first (#1), then goes the person in front of him (#2), and so on. The only condition is that no two people say the same number.

Clarification: After someone says a number, the people that go after him know which number he has said, but they don't know if he was right or wrong.

For each person that guesses his hat number correctly, the team earns one point.

The 2014 people know how the game functions before the hats are handed out, so they can talk to each other and try to form a strategy to maximize the number of points they earn.

The question is: what is the optimal strategy? What’s the best way for them to figure out their hat numbers? What’s the smallest number of points that the team can theoretically earn if they use that optimal strategy?

Post your opinion and/or solution about this problem via comment… Also, it would be awesome if you could subscribe to my newspaper, I need like 250 more subs for my next Media Mogul medal, so the subs mean a lot to me.

I hope you enjoy solving this. By the way, the problem was not created by me, its creator is some Russian dude whose name I don’t know…

I-G-D