This paper studies Ebert's hat problem for three and four 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 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帽子问题，其中每种颜色的概率可能因玩家而异。我们的目标是最大化游戏获胜概率并描述获胜策略。我们采用充分集的概念，其构造独立于基础概率，这一特性可用于分析本文所研究的广义情形。