A lower bound for the average number of rounds in permutation Wordle
Statement
In permutation Wordle, a setter chooses a hidden permutation uniformly from , and a strategy guesses permutations while receiving the positions that are correct. The number of rounds is the number of guesses needed to identify the hidden permutation.
Average-round lower-bound conjecture. For any strategy for permutation Wordle, the average number of rounds is at least
CircularShift achieves average rounds, so this conjecture is a weaker consequence of the proposed deadline-by-deadline optimality conjecture. It gives a universal lower bound on the expected performance of every strategy.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.