This paper studies Ebert's hat problem for three players and two colors, where the probabilities of the colors may be different for each player. Our goal is to maximize the probability of winning the game and to describe winning strategies We use the new concept of an adequate set. The construction of adequate sets is independent of underlying probabilities and we can use this fact in the analysis of our general case.

翻译：本文研究了三玩家两颜色的Ebert帽子问题，其中每位玩家对应的颜色概率可能不同。我们的目标是最大化获胜概率并描述获胜策略。我们引入了"充分集"这一新概念。充分集的构造与基础概率无关，这一特性可用于分析我们的广义情形。