Search
Abstract
The topic of our paper is the hat problem. In that problem, each of n people is randomly tted with a blue or red hat. Then everybody can try to guess simultanously his own hat color looking at the hat colors of the other people. The team wins if at least one person 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 win. In this version every person can see everybody excluding him. We considersuch problem on a graph, where vertices are people, and a person can see these people to which he is connected by an edge. The solution of the hat problem is known for trees. In this paper we solve the problem on the cycle C_4.
Cite as
Full text
full text is not available in portal
Keywords
Details
- Category:
- Articles
- Type:
- artykuły w czasopismach
- Published in:
-
International Mathematical Forum
no. 5,
pages 205 - 212,
ISSN: 1312-7594 - Language:
- English
- Publication year:
- 2010
- Bibliographic description:
- Krzywkowski M.: Hat problem on the cycle C4// International Mathematical Forum -Vol. 5,iss. 5 (2010), s.205-212
- Verified by:
- Gdańsk University of Technology
seen 58 times