This paper studies Ebert's hat problem with 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 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帽子问题，其中各玩家颜色概率可能不同。我们的目标是最大化获胜概率并描述获胜策略。我们引入了"适定集"这一新概念。适定集的构造不依赖于底层概率分布，这一特性可用于分析一般情形。