octans - Octans is a program to solve Algot's Wordplay (Wordsearch) puzzles

	Commit message (Collapse)	Author	Age	Files	Lines
*	Bump version to v0.1.1 v0.1.1	Andinus	2021-01-20	1	-1/+1
\|
*	Add install instructions to README	Andinus	2021-01-20	2	-7/+121
\|
*	Document new feature (reading puzzle from file), update README	Andinus	2021-01-20	2	-7/+13
\| \| \| \| \| \|	README was re-generated from README.org New feature was documented.
*	Allow future versions of WWW module to be used	Andinus	2021-01-20	1	-1/+1
\|
*	Read from file if passed, modify USAGE	Andinus	2021-01-20	3	-53/+86
\| \| \| \| \| \|	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.
*	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-structure for CPAN upload, include a dictionary file v0.1.0	Andinus	2021-01-19	10	-82/+355273
\| \| \| \|	bin/octans calls lib/Octans/CLI.rakumod which has the MAIN subroutine.
*	Re-implement octans, move subroutines to respective modules	Andinus	2021-01-19	8	-218/+410
\| \| \| \| \| \| \| \| \| \| \| \| \| \| \|	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
*	Document the implementation	Andinus	2021-01-14	1	-1/+71
\|
*	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	3	-0/+197