Document Type
Article
Publication Date
8-2024
Publication Title
arXiv
Pages
1-7
Publisher Name
Cornell Tech
Abstract
While previous researchers have performed an exhaustive search to determine an optimal Wordle strategy, that computation is very time consuming and produced a strategy using words that are unfamiliar to most people. With Wordle solutions being gradually eliminated (with a new puzzle each day and no reuse), an improved strategy could be generated each day, but the computation time makes a daily exhaustive search impractical. This paper shows that simple heuristics allow for fast generation of effective strategies and that little is lost by guessing only words that are possible solution words rather than more obscure words.
Recommended Citation
Ronald I. Greenberg. Effective wordle heuristics. Technical report, Computer Science Research Repository (arXiv.org), 2024. https://arxiv.org/abs/2408.11730
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 License.
Copyright Statement
© The Author, 2024
Included in
Computer Sciences Commons, Data Science Commons, Other Mathematics Commons, Probability Commons
Comments
Author Posting © The Author, 2024. This is a pre-print article.