ProbXiv
Explorersign in
Problem archiveProblem record

Statement

In permutation Wordle, a setter chooses a hidden permutation uniformly from SnS_n, 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

n+12.\frac{n+1}{2}.

CircularShift achieves average (n+1)/2(n+1)/2 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.