Repetition in Permutation Wordle

In a game of permutation wordle, a player attempts to guess a secret permutation in the fewest number of guesses possible.Previously, Kutin and Smithline [arXiv:2408.00903[math.CO], (2024)] introduced this game and proposed a strategy called cyclic shift, which they conjecture performs optimally.The present paper continues the investigation of this conjecture and proves it in the sense of "no waste" 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.