Search
Abstract
The topic is the hat problem in which each of n players is randomly 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 hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of winning. We consider a generalized hat problem with q >= 2 colors. We solve the problem with three players and three colors. Next we prove some upper bounds on the chance of success of any strategy for the generalized hat problem with n players and q colors. We also consider the numbers of strategies that suffice to be examined to solve the hat problem, or the generalized hat problem.
Cite as
Full text
- Publication version
- Accepted or Published Version
- License
-
open in new tab
Keywords
Details
- Category:
- Articles
- Type:
- artykuły w czasopismach recenzowanych i innych wydawnictwach ciągłych
- Published in:
-
Annales Universitatis Paedagogicae Cracoviensis. Studia Mathematica
no. 10,
pages 67 - 77,
ISSN: 2081-545X - Language:
- English
- Publication year:
- 2011
- Bibliographic description:
- Krzywkowski M.: A more colorful hat problem// Annales Universitatis Paedagogicae Cracoviensis. Studia Mathematica. -Vol. 10., (2011), s.67-77
- Verified by:
- Gdańsk University of Technology
seen 100 times