Permutation Wordle

Abstract

We introduce a guessing game, ``Permutation Wordle,'' in which a guesser attempts to recover a setter's hidden permutation of the set $\{1,\dots ,n\}$. In each round, the guesser submits a word over the alphabet $\{1,\dots ,n\}$, and, as in the game Wordle, learns which entries are correct. We describe a natural strategy and prove that it is optimal in a strong sense: for every $r$, it solves at least as many secrets within $r$ rounds as any possible strategy. The number of permutations it solves in exactly $k+1$ rounds is the Eulerian number $A(n,k)$.

19 pages