Consider a game of permutation wordle in which a player attempts to guess a secret permutation in S_n in as few guesses as possible. In each round, the guessing player is told which indices of their guessed permutation are correct. How can we optimize the player's strategy? Kutin and Smithline proposed a strategy called cyclic shift in which all incorrect entries are shifted one index to the right in successive guesses, and they conjectured its optimality. We investigate this conjecture by formalizing what a "strategy" looks like, performing experimental analysis on inductively constructed strategies, and examining the coefficients of an inductive strategy’s generating function.