Can I read Finding a Winning Strategy for Wordle is NP-complete on EtoBox?

Finding a Winning Strategy for Wordle is NP-complete by Rosenbaum, Will is a scholarly article available to read on EtoBox.

What is Finding a Winning Strategy for Wordle is NP-complete about?

In this paper, we give a formal definition of the popular word-guessing game Wordle. We show that, in general, determining if a given Wordle instance admits a winning strategy is NP-complete. We also show that given a Wordle instance of size $N$, a winning strategy that uses $g$ guesses in the worst case (if any) can be found in time $N^{O(g)}$.

Author

Rosenbaum, Will

Published

2022

Language

EN