Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Favorites infavorites:mine
infavorites:1234
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with Search options user 2627

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

6
votes
Suppose each person's hat color is selected independently and uniformly at random. Then the probability than any given person guesses their hat color correctly is $1/n$. There are $n$ people, so the …
answered May 30 '15 by Julian Rosen
10
votes
I will describe a lower bound and an upper bound on the probability of success the dwarves can guarantee. These bounds are: Lower bound: Imagine that there is a stack of 100 shirts in the corner of …
answered Aug 2 '15 by Julian Rosen
16
votes
5answers
There are 15 players who will play a cooperative game. They begin by closing their eyes. A referee will place either a black hat or a white hat (chosen by fair coin flip) on each player's head. The pl …
asked Jun 4 '15 by Julian Rosen
11
votes
One possibility is It is not possible for the wizards to do better. There are $16$ possible combinations of hat colors. Of these, $7$ of them have at least one wizard with no black hat, so cannot b …
answered Nov 4 '16 by Julian Rosen