## Welcome to BrainDen.com - Brain Teasers Forum

 Welcome to BrainDen.com - Brain Teasers Forum. Like most online communities you must register to post in our community, but don't worry this is a simple free process. To be a part of BrainDen Forums you may create a new account or sign in if you already have an account. As a member you could start new topics, reply to others, subscribe to topics/forums to get automatic updates, get your own profile and make new friends. Of course, you can also enjoy our collection of amazing optical illusions and cool math games. If you like our site, you may support us by simply clicking Google "+1" or Facebook "Like" buttons at the top. If you have a website, we would appreciate a little link to BrainDen. Thanks and enjoy the Den :-)
Guest Message by DevFuse

12 replies to this topic

### #1 howardl1963

howardl1963

Junior Member

• Members
• 99 posts

Posted 27 December 2010 - 12:35 PM

Ten friends walk into a room where each one of them receives a hat. On each hat is written a real number; no two hats have the same number. Each person can see the numbers written on his friends' hats, but cannot see his own. They are given some time to ponder the numbers on the other 9 hats. The friends then go into individual rooms where they are each given the choice between a white T-shirt and a black T-shirt. Wearing the respective T-shirts they selected, the friends gather again and are lined up in the ascending order of their hat numbers. The desired property is that the T-shirts colors now alternate.

The friends are allowed to decide on a strategy before walking into the room with the hats, but they are not allowed to communicate in any way with each other once the game starts. Design a strategy that lets the friends ALWAYS end up with alternating T-shirt colors.

This is a cool problem and I'm fairly certain I've solved it. The website, where I found it, does not offer solutions of any kind, so I'm hoping someone solves it with an explanation simpler than the one I've found. Enjoy!
• 0

### #2 csv

csv

Newbie

• Members
• 2 posts

Posted 27 December 2010 - 02:37 PM

Ten friends walk into a room where each one of them receives a hat. On each hat is written a real number; no two hats have the same number. Each person can see the numbers written on his friends' hats, but cannot see his own. They are given some time to ponder the numbers on the other 9 hats. The friends then go into individual rooms where they are each given the choice between a white T-shirt and a black T-shirt. Wearing the respective T-shirts they selected, the friends gather again and are lined up in the ascending order of their hat numbers. The desired property is that the T-shirts colors now alternate.

The friends are allowed to decide on a strategy before walking into the room with the hats, but they are not allowed to communicate in any way with each other once the game starts. Design a strategy that lets the friends ALWAYS end up with alternating T-shirt colors.

This is a cool problem and I'm fairly certain I've solved it. The website, where I found it, does not offer solutions of any kind, so I'm hoping someone solves it with an explanation simpler than the one I've found. Enjoy!

Spoiler for solution with communication defined as: Not letting others know the exact number by any way

• 0

### #3 wolfgang

wolfgang

Senior Member

• Members
• 783 posts
• Gender:Male

Posted 27 December 2010 - 04:03 PM

Spoiler for I have a long strategy

• 0

### #4 phillip1882

phillip1882

Senior Member

• Members
• 765 posts

Posted 27 December 2010 - 07:49 PM

hmm...
Spoiler for assuming no communication, period

• 0

### #5 bushindo

bushindo

Senior Member

• VIP
• 721 posts
• Gender:Male
• Location:Los Angeles, CA

Posted 27 December 2010 - 08:04 PM

Ten friends walk into a room where each one of them receives a hat. On each hat is written a real number; no two hats have the same number. Each person can see the numbers written on his friends' hats, but cannot see his own. They are given some time to ponder the numbers on the other 9 hats. The friends then go into individual rooms where they are each given the choice between a white T-shirt and a black T-shirt. Wearing the respective T-shirts they selected, the friends gather again and are lined up in the ascending order of their hat numbers. The desired property is that the T-shirts colors now alternate.

The friends are allowed to decide on a strategy before walking into the room with the hats, but they are not allowed to communicate in any way with each other once the game starts. Design a strategy that lets the friends ALWAYS end up with alternating T-shirt colors.

This is a cool problem and I'm fairly certain I've solved it. The website, where I found it, does not offer solutions of any kind, so I'm hoping someone solves it with an explanation simpler than the one I've found. Enjoy!

This is indeed a cool problem
Spoiler for strategy

Edited by bushindo, 27 December 2010 - 08:10 PM.

• 0

### #6 Callegreif

Callegreif

Newbie

• Members
• 1 posts

Posted 28 December 2010 - 02:11 AM

Uh, everything seems so complicated to my solution o_o
The way i understood it, the hats have numbers 1-10.
So if you look at friends hats and see the number missing, its yours.
And all people with even numbers could take black shirts and uneven ones whites.
Just a quick idea tho
• 0

### #7 howardl1963

howardl1963

Junior Member

• Members
• 99 posts

Posted 28 December 2010 - 10:30 AM

Uh, everything seems so complicated to my solution o_o
The way i understood it, the hats have numbers 1-10.
So if you look at friends hats and see the number missing, its yours.
And all people with even numbers could take black shirts and uneven ones whites.
Just a quick idea tho

The numbers are real numbers. So no matter what numbers you see, your number could be in any of the 10 positions. The 9 hats you see won't tell you anything about your postion.
• 0

### #8 howardl1963

howardl1963

Junior Member

• Members
• 99 posts

Posted 28 December 2010 - 10:34 AM

Spoiler for I have a long strategy

This would definitely be extra communication. Imagine, instead of going into the room and receiving your hat, you get your hat in an isolated room, and you are then informed of the numbers on the hats of your friends (and which friends received which hats) and then you have decide your T-shirt color before the host assembles you all in the room by ascending order.
• 0

### #9 howardl1963

howardl1963

Junior Member

• Members
• 99 posts

Posted 28 December 2010 - 11:16 AM

This is indeed a cool problem

Spoiler for strategy

Very well done bushindo. As I suspected, I had used a more brute force method for determining how out of order the hats were to do essentially the same thing. I'll elaborate in the spoiler.

Spoiler for My Method

• 0

### #10 Mesmer

Mesmer

Junior Member

• Members
• 23 posts

Posted 29 December 2010 - 06:24 PM

Spoiler for Simple Solution?

• 0

#### 0 user(s) are reading this topic

0 members, 0 guests, 0 anonymous users