3 problems

Suited CircularShift optimality conjecture. For each $r$, the probability that CircularShift guesses the correct suited permutation within $r$ guesses is at least as large as the c…

Average-round lower-bound conjecture. For any strategy for permutation Wordle, the average number of rounds is at least

CircularShift's optimality conjecture. For every strategy $\mathcal S$ and every $r\geq 1$,