2026/01/09 by Aurora Hiveley
Mathematics · #math.CO
paper · pdf · doi:10.47443/dml.2026.112
published as Discrete Math Letters, Vol. 17 (2026), pages 93-100 · 10 pages
arxiv created 2026/01/09 · arxiv updated 2026/08/04
In a game of permutation wordle, a player attempts to guess a secret permutation in the fewest number of guesses possible. Previously, Samuel Kutin and Lawren Smithline (arXiv:2408.00903) introduced this game and proposed a strategy called cyclic shift, which they conjecture performs optimally. We continue our investigation of this conjecture by considering how information is obtained and, at times, repeated during a game of permutation wordle using an arbitrary strategy. This analysis includes several algorithms to construct a secret permutation which prompts inefficient repetition according to the player's strategy, as well as proofs of their efficacy.