Login / Signup

Finding a Winning Strategy for Wordle is NP-complete.

Will Rosenbaum
Published in: CoRR (2022)
Keyphrases
  • np complete
  • winning strategy
  • np hard
  • randomly generated
  • constraint satisfaction problems
  • satisfiability problem
  • computational complexity
  • conjunctive queries