They lose 5/16 of the time and win 11/16 of the time, Q.E.D.
More detailed explanations about the cases where they win:
All hats: . One player sees and guesses correctly . The other 3 players see and guess nothing.
All hats: . Two players see and guess nothing. The other two see and guess correctly .
All hats: . All players see and guess correctly .
I don't know if this is the optimal strategy. I also tried to include randomness in the strategy (guess white with probability p1, black with probability p2, nothing with probability p3) and to use different strategies for each player. However, I couldn't improve from 11/16.
Re: Hat problem
Posted: Thu May 02, 2013 6:24 am
by Magicwand
my percentage 87.5%
strategy : who sees 3 of same color will guess right away.and say opposite color.
when no one i is guessing it means there are two color of each. so after while you know it is 2:2. so you know what color you have.
only time you will get it wrong it when it is all same color which is 2/16
14/16 you will be correct.
edit: and i see that someone already solved it
Re: Hat problem
Posted: Thu May 02, 2013 7:33 am
by Splatted
I think that the delayed guessing plans are no different from a secret signal and should be considered communication. In fact, everyone looking at their watches would become an unintended signal.
Re: Hat problem
Posted: Thu May 02, 2013 10:33 am
by drmwc
Time delay solutions will result in everyone being shot. The guesses all have to happen at exactly the same time, pre-assigned time.
jlaire is on the right lines. However, it's possible to do better than his solution.
For LocoRon, the wine is 1995 Dom Perignon, and so well worth taking a punt at...
Clue:
The fact they are bridge players is a (minor) clue.
Re: Hat problem
Posted: Thu May 02, 2013 4:22 pm
by Joaz Banbeck
I think that I am beginning to understand this problem...
drmwc wrote:
jlaire is on the right lines.
jlaire wrote:..
...All players follow the same strategy. ...
drmwc wrote: However, it's possible to do better than his solution.
Re: Hat problem
Posted: Thu May 02, 2013 5:15 pm
by palapiku
I wrote a brute force program using drmwc's hint and got a 12/16 solution. However I don't really understand it, so I won't post it for now.
Re: Hat problem
Posted: Thu May 02, 2013 7:13 pm
by Joaz Banbeck
I think that I have a theoretical understanding of the problem:
It is basically an information transfer problem. I recognized that early on, and concluded that since they were not allowed to communicate, the problem was mis-stated.
However, jlaire demonstrated that there is more than meets the eye. The pre-arranged agreement is a code, and the stones that they see are the key. Different patterns of stones mean different keys, which effectively allows them to communicate.
jlaire made one slight oversight. He assumed that the key = the stones that they see.
Whereas, actually, key = the stones that they see AND where they see them.
This allows more keys, and, therefore, the effective transfer of more information.
This means that, as a practical matter...
. <> <>
About Drmwc's clue:
This, BTW, explains what Drmwc meant by
drmwc wrote:...The fact they are bridge players is a (minor) clue.
Bridge players think in terms of position. A bid by the opponent to your left is not the same as the same bid made by your opponent to the right.
That means that to improve on Jlaire's solution, you probably have to look here:
jlaire wrote:... -> lose (4 permutations)...
Re: Hat problem
Posted: Thu May 02, 2013 8:11 pm
by palapiku
That's not how I interpreted the hint, by the way.
Re: Hat problem
Posted: Thu May 02, 2013 10:26 pm
by Joaz Banbeck
I think that Jlaire's 4 possible distributions have to be 5. When it is 2+2, there are two possible positional options: adjacent or opposite.
-> guess -> no guess -> no guess -> guess -> guess -> no guess -> guess -> guess
( everything to the right of the arrows is just a guess about guessing )
Re: Hat problem
Posted: Fri May 03, 2013 10:11 am
by drmwc
I believe that something like Joaz's solution can work (although I've not checked that solution in detail).
There is a simpler approach that gets 75%.
Big clue:
Nominate someone to be dummy.
Re: Hat problem
Posted: Fri May 03, 2013 11:08 am
by tj86430
drmwc wrote:I believe that something like Joaz's solution can work (although I've not checked that solution in detail).
There is a simpler approach that gets 75%.
Big clue:
Nominate someone to be dummy.
Ok, got it now:
Ignore one player altogether (he doesn't guess, and no one is interested in his hat
The remaining three will do as follows:
- if you see two hats of different color, don't guess
- if you see two hats of same color, guess the other color
Re: Hat problem
Posted: Fri May 03, 2013 11:44 am
by rhubarb
tj86430 wrote:
drmwc wrote:Big clue:
Nominate someone to be dummy.
Ok, got it now:
Ignore one player altogether (he doesn't guess, and no one is interested in his hat
The remaining three will do as follows:
- if you see two hats of different color, don't guess
- if you see two hats of same color, guess the other color
In the spirit of the puzzle, an amendment:
Ignore one player altogether (he doesn't guess, and no one is interested in his hat During deliberation, before hat distribution, shoot one player.
Re: Hat problem
Posted: Fri May 03, 2013 11:52 am
by palapiku
Nicely done!
Turns out i misinterpreted the bridge hint after all.
I interpreted it to mean that the 4 players separate into partnerships, each with its own strategy. This gives two 12/16 solutions, which are completely different from tj86430's. In particular, nobody is left out - everyone has a potential to make a guess.
The fact that there are several 12/16 solutions suggests that it could be possible to do even better... I suppose the next step is to prove that that is impossible.
Re: Hat problem
Posted: Fri May 03, 2013 12:35 pm
by yoyoma
Go version of the hint:
There are 4 kibitzers: 1 guest, and 3 registered [1d] players.
Re: Hat problem
Posted: Fri May 03, 2013 12:51 pm
by tj86430
Perhaps it would be nice to hide the previous message, since the hint is still hidden.