| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Add install instructions to README | Andinus | 2021-01-20 | 1 | -0/+40 |
| | | |||||
| * | Document new feature (reading puzzle from file), update README | Andinus | 2021-01-20 | 1 | -2/+3 |
| | | | | | | | README was re-generated from README.org New feature was documented. | ||||
| * | Add latest demo link | Andinus | 2021-01-20 | 1 | -2/+5 |
| | | | | | | Octans found 10 solutions to this puzzle: https://mastodon.art/@Algot/105413312119416356 | ||||
| * | Add v0.1.0 demo links | Andinus | 2021-01-20 | 1 | -2/+3 |
| | | |||||
| * | Re-implement octans, move subroutines to respective modules | Andinus | 2021-01-19 | 1 | -6/+22 |
| | | | | | | | | | | | | | | | | 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 | ||||
| * | Add links to website, source, github | Andinus | 2021-01-14 | 1 | -0/+4 |
| | | |||||
| * | Add demo links | Andinus | 2021-01-14 | 1 | -4/+14 |
| | | |||||
| * | Initial commit | Andinus | 2021-01-14 | 1 | -0/+22 |