Originally posted by Wouter D
View Post
It's possible for an adversarial algorithm to do better than choosing the class with the most members. There may be a class with fewer members but that requires more guesses to solve through. For example after SPOILER, SPOILER, it chooses the class with 11 entries, which is soluble in 2 more moves. There is an alternative class with 8 entries that isn't soluble in 2 moves.
Said people are using phrases like "Absurdle is a greedy algorithm but not an optimal one."
Comment