  This paper studies asymmetric Ebert's Hat Problem with five players where the
probability of the colors may be unequal. We obtain maximal winning
probabilities and optimal winning strategies using the concept of adequate
sets.
