| Commit message (Collapse) | Author | Age | Files | Lines |
|---|
| | |
|
| | |
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
NEWS:
⁃ Removed `sample' option
`--sample' will not solve the sample puzzle.
⁃ Removed shorthand for verbose option
`-v' won't work in `v0.2.0'.
⁃ Change representation of visited squares
When `--verbose' was passed, it would print the solved puzzle with
visited squares replaced with fancy characters. Now it marks them by
adding:
• `*' to visited + gray squares (start positions)
• `/' to visited squares
⁃ Removed time taken
Time taken won't be printed anymore.
It was misleading because the time printed was not the
time taken to find that specific word, it was the time
taken to find all the words upto that word. It would
reset for each starting position.
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| |
|
|
| |
I had entered 2020 everywhere out of habit, changed them all to 2021!
|
| | |
|
| |
|
|
|
|
| |
README was re-generated from README.org
New feature was documented.
|
| |
|
|
|
| |
Octans found 10 solutions to this puzzle:
https://mastodon.art/@Algot/105413312119416356
|
| | |
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
Initially it went over the list of words & checked if they exist in
the grid. This was very slow.
Currently it walks the grid & checks if the current string exist in
the dictionary. This is faster for these reasons:
• The dictionary is sorted, we perform binary range search on the
dictionary to return the list of all words that start with specific
string.
• Starting positions are limited.
If the dictionary wasn't sorted then this probably would've been
|
| | |
|
| | |
|
| |
|