about summary refs log tree commit diff stats
path: root/README.org
Commit message (Collapse)AuthorAgeFilesLines
* Add a note about without-www branchAndinus2021-03-041-0/+3
|
* Release v0.2.0 v0.2.0Andinus2021-03-041-1/+30
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 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.
* Structural changes in READMEAndinus2021-02-191-4/+2
|
* Bump version to v0.1.4, document changes v0.1.4Andinus2021-02-191-21/+51
|
* Document the origin of neighbors subroutineAndinus2021-01-261-0/+3
|
* Remove section numbers from README, document length optionAndinus2021-01-251-2/+3
|
* Bump version to v0.1.3, document changes v0.1.3Andinus2021-01-241-0/+3
|
* Document new feature in READMEAndinus2021-01-201-0/+3
|
* Fix dates in READMEAndinus2021-01-201-3/+3
| | | | I had entered 2020 everywhere out of habit, changed them all to 2021!
* Add install instructions to READMEAndinus2021-01-201-0/+40
|
* Document new feature (reading puzzle from file), update READMEAndinus2021-01-201-2/+3
| | | | | | README was re-generated from README.org New feature was documented.
* Add latest demo linkAndinus2021-01-201-2/+5
| | | | | Octans found 10 solutions to this puzzle: https://mastodon.art/@Algot/105413312119416356
* Add v0.1.0 demo linksAndinus2021-01-201-2/+3
|
* Re-implement octans, move subroutines to respective modulesAndinus2021-01-191-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, githubAndinus2021-01-141-0/+4
|
* Add demo linksAndinus2021-01-141-4/+14
|
* Initial commitAndinus2021-01-141-0/+22