Rank One Approximation as a Strategy for Wordle
share
This paper presents a mathematical method of playing the puzzle game Wordle. In Wordle, the player has six tries to guess a secret word. After each guess the player is told how their guess compares to the secret word. With the available information the player makes their next guess. This paper proposes combining a rank one approximation and latent semantic indexing to a matrix representing the list of all possible solutions. Rank one approximation finds the dominant eigenvector of a matrix of words, and latent semantic indexing reveals which word is closest to the dominant eigenvector. The word whose column vector is closest to the dominant eigenvector is chosen as the next guess. With this method the most representative word of the set of all possible solutions is selected. This paper describes how a word can be converted to a vector and the theory behind a rank one approximation and latent semantic indexing. This paper presents results demonstrating that with an initial guess of "SLATE" the method solves the puzzle in 4.04 guesses on average, with a success rate of 98.7
READ FULL TEXT