The Three Hat Problem
| dc.creator | Benson, Brian | |
| dc.creator | Wang, Yang | |
| dc.date | 2007-10-14 | |
| dc.date.accessioned | 2026-07-07T08:36:17Z | |
| dc.date.available | 2026-07-07T08:36:17Z | |
| dc.description | In this paper we study the Three Hat Problem which appeared in Puzzle Corner of the Technology Review magazine. This puzzle gives a scenario in which three players wearing hats are sitting together and each hat can be seen by everyone except the player that is wearing that hat. Each player is told that all of the hats contain a positive integer and that two of the integers add to the third. In an ordered, turn-wise, modular fashion, each player truthfully states whether or not he knows his integer. We give a strategy which allows for one of the players to solve for his integer for all possible integer configurations of the puzzle and prove it is the optimal such strategy. | |
| dc.description | 11 pages, 0 figures | |
| dc.identifier | https://arxiv.org/abs/0710.2685 | |
| dc.identifier | http://arxiv.org/abs/0710.2685 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/140011 | |
| dc.subject | History and Overview | |
| dc.title | The Three Hat Problem | |
| dc.type | text |