Crates.io | wordle-suggest |
lib.rs | wordle-suggest |
version | 0.1.1 |
source | src |
created_at | 2022-02-06 23:47:49.393763 |
updated_at | 2022-02-08 14:25:10.528265 |
description | Wordle suggestions CLI |
homepage | https://github.com/alexgenco/wordle-suggest |
repository | https://github.com/alexgenco/wordle-suggest |
max_upload_size | |
id | 528086 |
size | 143,848 |
wordle-suggest
Run without arguments to get a list of good starter words:
$ wordle-suggest
carey
casey
money
salem
marie
saver
karen
saved
safer
panel
Enter one into the puzzle and write the result to a file using the following syntax:
Syntax | Meaning |
---|---|
a^ |
a is in the correct position (green) |
b? |
b is in the incorrect position (yellow) |
c |
c is not in the word (gray) |
For example, this result:
Is represented like this:
s^cr?a^p
Assume this file is called hints.txt
. Re-run wordle-suggest
and point it
to this file to get a new set of suggestions:
$ wordle-suggest -f ./hints.txt
solar
sugar
# ...
Continue adding results to the hints file and re-running wordle-suggest
until you've solved the puzzle!
See wordle-suggest -h
for more usage options.
The words are stored in a priority queue (a BinaryHeap
specifically), based
on the frequency of each letter in its specific position compared to the entire
word list (words/all.txt
), as well as its presence in a list
of common words (words/common.txt
). So the returned words
are sorted by their probability of having their letters in the correct
positions, with common words appearing first.