  Winning probabilities of The Hat Game (Ebert's Hat Problem) with three
players and three colors are only known in the symmetric case: all
probabilities of the colors are equal. This paper solves the asymmetric case:
probabilities may be different. We find winning probabilies and optimal
strategies in all cases.
