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

	Commit message (Collapse)	Author	Age	Files	Lines
*	When computing neighbors, set it to an empty array	Andinus	2021-01-26	1	-3/+6
\| \| \| \| \|	If we don't find any neighbors then we shouldn't have to recompute this result.
*	Add an option to specify minimum length	Andinus	2021-01-24	1	-2/+3
\|
*	Allow the input puzzle to be of any size	Andinus	2021-01-20	2	-45/+34
\| \| \| \| \| \| \| \| \| \| \|	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.
*	Read from file if passed, modify USAGE	Andinus	2021-01-20	2	-53/+82
\| \| \| \| \| \|	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.
*	Re-structure for CPAN upload, include a dictionary file v0.1.0	Andinus	2021-01-19	5	-6/+105
\| \| \| \|	bin/octans calls lib/Octans/CLI.rakumod which has the MAIN subroutine.
*	Re-implement octans, move subroutines to respective modules	Andinus	2021-01-19	4	-0/+246
	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