Simple implementation of greedy min-max wordle strategy. For each step choose the guess that results in the fewest candidate solutions.
run main.py for interactive prompt.
Requires packages numpy and tqdm.
-
Notifications
You must be signed in to change notification settings - Fork 0
josh-gleason/wordle-greedy
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Greedy min-max wordle strategy
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published