Abstract:
The wordle game is a game that has gained great popularity this year, with many players sharing their game
results on social networks. A five-letter word is selected each day which players have six chances to find, where after
each guess the player is given clues as to which letter is in the final answer or even in the correct position. What would
be the optimal word that would lead us to the final answer, and what are the chances of finding this answer in the fewest
trials? An efficient way is to use information entropy. In this paper we will talk about the Wordle game and information
theory using a project I built on the JavaScript programming language (https://shkodi.github.io/WordleSolver/), where
we will see the advantages and disadvantages of using of entropy in measuring the information contained in each word
and selecting the optimal ones. We will consider other possibilities that help us improve the efficiency of the algorithm,
as well as analyze different algorithms and their performance in relation to the use of entropy
