Rand Stats

octans

zef:andinus

Table of Contents

  1. Demo
  2. Documentation
  3. News
Websitehttps://andinus.unfla.me/projects/octans
Sourcehttps://git.unfla.me/octans
GitHubhttps://github.com/andinus/octans

Demo

This was recorded with asciinema.

img

Documentation

Implementation

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:

If the dictionary wasn't sorted then this probably would've been slower than previous implementation.

The neighbors subroutine (lib/Octans/Neighbors.rakumod) was taken from my AoC (Advent of Code) 2020's day-11 solution.

Options

dict

Octans's default dictionary file is /usr/share/dict/words, use --dict flag to change the dictionary. The words in dictionary must be seperated by a newline (\n) & sorted alphabetically.

visualize

Generates a video solution for the puzzle.

length

Minimum word length to look for. Default is 7.

path

The path to be passed must be a readable file or an url in either format:

verbose

This will increase verbosity.

News

v0.2.5 - 2023-07-02

v0.2.3 - 2022-01-12

v0.2.0 - 2021-03-04

v0.1.4 - 2021-02-19

v0.1.3 - 2021-01-24

v0.1.2 - 2021-01-20

v0.1.1 - 2021-01-20

v0.1.0 - 2021-01-19