| Commit message (Collapse) | Author | Age | Files | Lines |
|---|
| | |
|
| | |
|
| | |
|
| |
|
|
|
|
|
|
|
|
|
| |
It should still be a 2d grid but can have any number of grids, not
necessarily MxN. Even this is a valid input:
a b c
s d e r c
This input should be valid even when parsing the url. It will
certainly be valid when the input is a file.
|
| |
|
|
| |
I had entered 2020 everywhere out of habit, changed them all to 2021!
|
| | |
|
| | |
|
| |
|
|
|
|
| |
README was re-generated from README.org
New feature was documented.
|
| | |
|
| |
|
|
|
|
| |
Previouly, the only way of passing the puzzle was to enter a url. Now
octans is able to read from files too. If the file exist & it's
readable then octans will read the puzzle from there.
|
| |
|
|
|
| |
Octans found 10 solutions to this puzzle:
https://mastodon.art/@Algot/105413312119416356
|
| | |
|
| |
|
|
| |
bin/octans calls lib/Octans/CLI.rakumod which has the MAIN subroutine.
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
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
|
| | |
|
| | |
|
| | |
|
| |
|