Questions tagged [hat-guessing]

Cooperative games where a team of players must try to guess the color of their hat, but can only see their teammates' hats.

In these puzzles, a team of players are gathered, and one of several colored hats is placed on each of their heads. Without being able to see their own hat, each player must then guess what color their hat is. Before the game begins, the players may agree on a strategy, but after the hats are placed, no further communication is possible. Often, it is assumed the hats are chosen randomly.

NOT included in this tag are deduction puzzles where the perfectly logical participants are given information and then are asked to deduce their hat colors, like the four prisoners riddle or any of the blue-eyed islanders type puzzles. The appropriate tag for these is .

Though this framework sounds very specific, the solving these problems uses a wide variety of mathematical concepts, like modular arithmetic, Hamming codes, expected value of random variables, and permutations.

A classic example of such a problem is Hats and Aliens.

10 humans are abducted by aliens; each represents 10% of the entire human population. The aliens give each abductee either a purple hat or a green hat. The 10 are lined up in a single file line, each facing forward, such that the last person can see the remaining 9's hats, the second to last person can see the remaining 8's hats and so on. No one can see his or her own hat.

The aliens then proceed, starting from the last person, to ask each of the abductees what the color of their hat is. If they guess correctly, they and the 10% of the human population they represent survives; if not, the opposite happens.

Assuming the abductees are given a chance to develop a strategy before they are lined up and questioned: what is the optimal strategy they can utilize (i.e. the one with the highest expected number of survivals)?

During the questioning, the abductees are not allowed to say anything besides their guess for the color of their hat when it is their turn.

75 questions
23
votes
2 answers

Alternating Hat Colors

A prison warden offers his inmates a game for their freedom. He will secretly write a number on each of their foreheads, with no two foreheads having the same number. The inmates get to look around, seeing every other inmates' forehead, but not…
Mike Earnest
  • 32,336
  • 6
  • 92
  • 237
12
votes
8 answers

Infinitely many hats

We are given countably many people numbered $1,2,3,\ldots$ for all $n\in \mathbb{N}$, each wearing a hat that is either black or white. No-one can see the color of their hat, but everyone can see everyone else's hat. Now everyone has to guess the…
12
votes
9 answers

Numbered hats, Warden and Maths

You are one of 4 prisoners. Tomorrow will be a deciding day: the warden has told you and your cellmates that you can all go free, or all be executed, depending on how you answer tomorrow's challenge. He was kind enough to let you and your cellmates…
HugoBDesigner
  • 1,498
  • 1
  • 10
  • 22
11
votes
11 answers

Infinite wizards and hats

Each of an infinite number of wizards is independently assigned a black or white hat based on the outcome of an unbiased coin flip. Each wizard can see everyone's hat but his own. At the count of three, each wizard must simultaneously either guess…
dshin
  • 1,533
  • 10
  • 15
5
votes
1 answer

Multi-variable hat guessing

Here is a variation of the hat-guessing logicians problem. 100 logicians are given hats. They know that: All the hats are either black or white Each hat may or may not have green stripes on it Each hat may or may not have a pompom on top At least…
Ilak
  • 407
  • 2
  • 9
2
votes
2 answers

Number hats puzzling

10 people will stand in a circle, and each have a hat placed on their head. The hats will each be labeled with a digit between 0 and 9, with repeats allowed. They will be able to see everyone's hat but their own. After looking around, they must all…