2 ms·

There is a wordle parody (absurdle) [0] that does exactly this. [0] https://qntm.org/files/wordle/ https://qntm.org/files/wordle/

• pxx 5y ago
  No it does not. It uses a heuristic at every layer of the tree. Specifically, instead of recursing down each subtree, it chooses the set with the maximum number of remaining elements, which isn't necessarily the set that is most difficult to split.
  • ford 5y ago
    I see - I misunderstood the parent comment. I believe you are saying that the best adversary would attempt to maximize the depth of the tree. For example a branch with "{L, B, C, R, ..}ake" requires more guesses than a balanced tree despite the fact that the two trees may have the same number of nodes.