A New Variation of Hat Guessing Games

  • Tengyu Ma
  • Xiaoming Sun
  • Huacheng Yu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6842)


Several variations of hat guessing games have been popularly discussed in recreational mathematics. In a typical hat guessing game, after initially coordinating a strategy, each of n players is assigned a hat from a given color set. Simultaneously, each player tries to guess the color of his/her own hat by looking at colors of hats worn by other players. In this paper, we consider a new variation of this game, in which we require at least k correct guesses and no wrong guess for the players to win the game, but they can choose to “pass”.

A strategy is called perfect if it can achieve the simple upper bound \(\frac{n}{n+k}\) of the winning probability. We present sufficient and necessary condition on the parameters n and k for the existence of perfect strategy in the hat guessing games. In fact for any fixed parameter k, the existence of a perfect strategy for (n,k) is open for only a few values of n.

In our construction we introduce a new notion: (d 1,d 2)-regular partition of the boolean hypercube, which is worth to study in its own right. For example, it is related to the k-dominating set of the hypercube. It also might be interesting in coding theory. The existence of (d 1,d 2)-regular partition is explored in the paper and the existence of perfect k-dominating set follows as a corollary.


Hat guessing game perfect strategy hypercube k- dominating set perfect code 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aspnes, J., Beigel, R., Furst, M., Rudich, S.: The expressive power of voting polynomials. Combinatorica 14, 135–148 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Buhler, J., Butler, S., Graham, R., Tressler, E.: Hypercube orientations with only two in-degrees. Journal of Combinatorial Theory, Series A 118, 1695–1702 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Butler, S., Hajiaghayi, M., Kleinberg, R., Leighton, T.: Hat guessing games. SIAM J. Discrete Math. 22(2), 592–605 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Ebert, T.: Applications of recursive operators to randomness and complexity. PhD thesis, University of California at Santa Barbara (1998)Google Scholar
  5. 5.
    Feige, U.: You can leave your hat on (if you guess its color). Technical Report MCS04-03, Computer Science and Applied Mathematics, The Weizmann Institute of Science (2004)Google Scholar
  6. 6.
    Feige, U.: On optimal strategies for a hat game on graphs. SIAM Journal of Discrete Mathematics 24(3), 782–791 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Harris, J., Hirst, J., Mossinghoff, M.: Combinatorics and graph theory, 2nd edn. Springer, Heidelberg (2008)CrossRefzbMATHGoogle Scholar
  8. 8.
    Krzywkowski, M.: On the hat problem on the cycle c 7. Int. J. Contemp. Math. Sciences 5(43), 2137–2148 (2010)MathSciNetzbMATHGoogle Scholar
  9. 9.
    Lenstra, H.W., Seroussi, G.: On hats and other covers. In: Proceedings of the IEEE International Symposium on Information Theory, p. 342 (2002)Google Scholar
  10. 10.
    Paterson, M., Stinson, D.: Yet another hat game. The Electronic Journal of Combinatorics 17(1), #R86 (2010)MathSciNetzbMATHGoogle Scholar
  11. 11.
    Winkler, P.: Games people don’t play. Puzzlers’ Tribute: A Feast for the Mind, 301–313 (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Tengyu Ma
    • 1
  • Xiaoming Sun
    • 2
  • Huacheng Yu
    • 1
  1. 1.Institute for Theoretical Computer ScienceTsinghua UniversityChina
  2. 2.Institute for Advanced StudyTsinghua UniversityChina

Personalised recommendations