For which graphs the sages can guess correctly the color of at least one hat (Q2632547): Difference between revisions

The authors consider the hat guessing game. We have $n$ sages. who occupy the vertices of a graph, and a lot of hats of $k$ different colors. The sages try to guess the colors of their own hats, without any communication. We say that the graph has winning strategy, if for all possible placements of hats, at least one of the sages guesses the color correctly. \par The authors determine all graphs with winning strategy for hats in three colors, i.e. $k=3$. Moreover, the authors also consider the variant of the game with hints. \par The paper is very well written and contains many interesting results.