Hat problem

All non-Go discussions should go here.
jlaire
Beginner
Posts: 17
Joined: Thu Dec 27, 2012 2:36 am
Rank: EGF 2 dan
GD Posts: 0
Location: Finland
Has thanked: 3 times
Been thanked: 5 times

Re: Hat problem

Post by jlaire »

My solution is here, don't read if you want to solve it yourself. No silly tricks with time delays or anything like that.
All players follow the same strategy. Their guess is determined by the 3 colors they see.

:white: :white: :white: -> guess :black:
:white: :white: :black: -> no guess
:white: :black: :black: -> guess :white:
:black: :black: :black: -> guess :black:

They will win a bottle with probability 68.75%. Proof:

:white: :white: :white: :white: -> lose
:white: :white: :white: :black: -> win (4 permutations)
:white: :white: :black: :black: -> win (6 permutations)
:white: :black: :black: :black: -> lose (4 permutations)
:black: :black: :black: :black: -> win

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: :white: :white: :white: :black:. One player sees :white: :white: :white: and guesses correctly :black:. The other 3 players see :white: :white: :black: and guess nothing.

All hats: :white: :white: :black: :black:. Two players see :white: :white: :black: and guess nothing. The other two see :white: :black: :black: and guess correctly :white:.

All hats: :black: :black: :black: :black:. All players see :black: :black: :black: and guess correctly :black:.



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.
User avatar
Magicwand
Tengen
Posts: 4844
Joined: Wed Apr 21, 2010 5:26 am
Rank: Wbaduk 7D
GD Posts: 0
KGS: magicwand
Tygem: magicwand
Wbaduk: rlatkfkd
DGS: magicwand
OGS: magicwand
Location: Mechanicsburg, PA
Has thanked: 62 times
Been thanked: 504 times

Re: Hat problem

Post 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 :)
"The more we think we know about
The greater the unknown"

Words by neil peart, music by geddy lee and alex lifeson
Splatted
Lives in sente
Posts: 734
Joined: Mon Apr 26, 2010 12:41 pm
Rank: Washed up never was
GD Posts: 0
Universal go server handle: Splatted
Has thanked: 681 times
Been thanked: 138 times

Re: Hat problem

Post 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.
User avatar
drmwc
Lives in gote
Posts: 452
Joined: Sat Dec 01, 2012 2:18 pm
Rank: 4 Dan European
GD Posts: 0
Has thanked: 74 times
Been thanked: 100 times

Re: Hat problem

Post 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.
User avatar
Joaz Banbeck
Judan
Posts: 5546
Joined: Sun Dec 06, 2009 11:30 am
Rank: 1D AGA
GD Posts: 1512
Kaya handle: Test
Location: Banbeck Vale
Has thanked: 1080 times
Been thanked: 1434 times

Re: Hat problem

Post 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.
Help make L19 more organized. Make an index: https://lifein19x19.com/viewtopic.php?f=14&t=5207
User avatar
palapiku
Lives in sente
Posts: 761
Joined: Sun Apr 25, 2010 11:25 pm
Rank: the k-word
GD Posts: 0
Has thanked: 152 times
Been thanked: 204 times

Re: Hat problem

Post 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.
User avatar
Joaz Banbeck
Judan
Posts: 5546
Joined: Sun Dec 06, 2009 11:30 am
Rank: 1D AGA
GD Posts: 1512
Kaya handle: Test
Location: Banbeck Vale
Has thanked: 1080 times
Been thanked: 1434 times

Re: Hat problem

Post 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...
. :black: :black: :white: <> :black: :white: :black: <> :white: :black: :black:
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:...
:white: :black: :black: :black: -> lose (4 permutations)...
Help make L19 more organized. Make an index: https://lifein19x19.com/viewtopic.php?f=14&t=5207
User avatar
palapiku
Lives in sente
Posts: 761
Joined: Sun Apr 25, 2010 11:25 pm
Rank: the k-word
GD Posts: 0
Has thanked: 152 times
Been thanked: 204 times

Re: Hat problem

Post by palapiku »

That's not how I interpreted the hint, by the way.
User avatar
Joaz Banbeck
Judan
Posts: 5546
Joined: Sun Dec 06, 2009 11:30 am
Rank: 1D AGA
GD Posts: 1512
Kaya handle: Test
Location: Banbeck Vale
Has thanked: 1080 times
Been thanked: 1434 times

Re: Hat problem

Post 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.

:white: :white: :white: :white:
:white: :white: :white: :black: (4 permutations)
:white: :black: :white: :black: (6 2 permutations)
:white: :white: :black: :black: (6 4 permutations)
:white: :black: :black: :black: (4 permutations)
:black: :black: :black: :black:
Instead of merely four instructions, like this:

:white: :white: :white: -> guess :black:
:white: :white: :black: -> no guess
:white: :black: :black: -> guess :white:
:black: :black: :black: -> guess :black:

There should be eight like this:

:white: :white: :white: -> guess :black:
:white: :white: :black: -> no guess
:white: :black: :white: -> no guess
:white: :black: :black: -> guess :white:
:black: :white: :white: -> guess :black:
:black: :white: :black: -> no guess
:black: :black: :white: -> guess :black:
:black: :black: :black: -> guess :black:

( everything to the right of the arrows is just a guess about guessing )
Help make L19 more organized. Make an index: https://lifein19x19.com/viewtopic.php?f=14&t=5207
User avatar
drmwc
Lives in gote
Posts: 452
Joined: Sat Dec 01, 2012 2:18 pm
Rank: 4 Dan European
GD Posts: 0
Has thanked: 74 times
Been thanked: 100 times

Re: Hat problem

Post 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.
tj86430
Gosei
Posts: 1348
Joined: Wed Apr 28, 2010 12:42 am
Rank: FGA 7k GoR 1297
GD Posts: 0
Location: Finland
Has thanked: 49 times
Been thanked: 129 times

Re: Hat problem

Post 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
Offending ad removed
rhubarb
Dies in gote
Posts: 31
Joined: Fri Jul 27, 2012 10:28 pm
Rank: mid-SDK
GD Posts: 0
DGS: rhubarber
Universal go server handle: rhubarb
Location: Vancouver
Has thanked: 92 times
Been thanked: 14 times

Re: Hat problem

Post 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.
User avatar
palapiku
Lives in sente
Posts: 761
Joined: Sun Apr 25, 2010 11:25 pm
Rank: the k-word
GD Posts: 0
Has thanked: 152 times
Been thanked: 204 times

Re: Hat problem

Post 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.
yoyoma
Lives in gote
Posts: 653
Joined: Mon Apr 19, 2010 8:45 pm
GD Posts: 0
Location: Austin, Texas, USA
Has thanked: 54 times
Been thanked: 213 times

Re: Hat problem

Post by yoyoma »

Go version of the hint:
There are 4 kibitzers: 1 guest, and 3 registered [1d] players.
tj86430
Gosei
Posts: 1348
Joined: Wed Apr 28, 2010 12:42 am
Rank: FGA 7k GoR 1297
GD Posts: 0
Location: Finland
Has thanked: 49 times
Been thanked: 129 times

Re: Hat problem

Post by tj86430 »

Perhaps it would be nice to hide the previous message, since the hint is still hidden.
Offending ad removed
Post Reply