Hypothesis
Since we know Wordle is solve-able using decision trees, we can make certain assumptions to create a max = 4 algorithm.
IDEA
A decision tree operates linearly based on the previous guess after the first guess (which contains no known information). Create a strategy that guesses based on information theory, but only guesses solutions that the decision tree can guarantee are valid (until an answer can be found within 2 turns).
*I don't have any technical details beyond this, nor can I test it at this time. However, this may spark more ideas for you.
Hypothesis Since we know Wordle is solve-able using decision trees, we can make certain assumptions to create a max = 4 algorithm.
IDEA A decision tree operates linearly based on the previous guess after the first guess (which contains no known information). Create a strategy that guesses based on information theory, but only guesses solutions that the decision tree can guarantee are valid (until an answer can be found within 2 turns).
*I don't have any technical details beyond this, nor can I test it at this time. However, this may spark more ideas for you.