Yet another hat game (Q976746): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1001.3850 / rank | |||
Normal rank |
Latest revision as of 18:12, 18 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Yet another hat game |
scientific article |
Statements
Yet another hat game (English)
0 references
16 June 2010
0 references
Summary: Several different ``hat games'' have recently received a fair amount of attention. Typically, in a hat game, one or more players are required to correctly guess their hat colour when given some information about other players' hat colours. Some versions of these games have been motivated by research in complexity theory and have ties to well-known research problems in coding theory, and some variations have led to interesting new research. In this paper, we review Ebert's Hat Game, which garnered a considerable amount of publicity in the late 90's and early 00's, and the Hats-on-a-line Game. Then we introduce a new hat game which is a ``hybrid'' of these two games and provide an optimal strategy for playing the new game. The optimal strategy is quite simple, but the proof involves an interesting combinatorial argument.
0 references
Ebert's hat game
0 references
hats-on-a-line game
0 references
optimal strategy
0 references