On the hat problem on a graph
The topic of this paper is the hat problem in which each of \(n\) players is uniformly and independently fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his...
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
AGH Univeristy of Science and Technology Press
2012-01-01
|
Series: | Opuscula Mathematica |
Subjects: | |
Online Access: | http://www.opuscula.agh.edu.pl/vol32/2/art/opuscula_math_3221.pdf |