The recent popularity of Wordle has revived interest in guessing games. We develop a general method for finding optimal strategies for guessing games while avoiding an exhaustive search. Our main contributions are several theorems that build towards a general theory to prove the optimality of a strategy for a guessing game. This work is developed to apply to any guessing game, but we use Wordle as an example to present concrete results.

翻译：Wordle的近期流行重新激发了人们对猜词游戏的兴趣。我们提出了一种避免穷举搜索的通用方法，用于寻找猜词游戏的最优策略。本文的主要贡献在于构建了一系列定理，这些定理为证明猜词游戏策略的最优性奠定了普适性理论基础。该研究工作适用于任何猜词游戏，但本文以Wordle为例呈现具体结果。