I'd like to write a fast and efficient baffle/boggle solver. It would be a library and cli implementation of the library.
- any size board, but optimize 4,5,6
- runtime > space
- scrabble or (less optimized) loaded from file
- q tile?
boggle solver examples
https://stackoverflow.com/questions/746082/how-to-find-list-of-possible-words-from-a-letter-matrix-boggle-solver https://github.com/machineboy2045/fast-boggle-solver https://thraxil.org/users/anders/posts/2011/04/17/A-Boggling-Return-to-C/ https://github.com/elfsternberg/boggle-solver https://github.com/bilash/boggle-solver https://github.com/AmokHuginnsson/boggle-solvers/blob/master/solve.go
scrabble
https://github.com/vthorsteinsson/GoSkrafl
possible dictionary data structures
Prefix Tree (trie)
https://en.wikipedia.org/wiki/Trie
Radix Tree (patricia: based on trie)
https://github.com/hashicorp/go-immutable-radix https://github.com/tchap/go-patricia
DAWG
https://en.m.wikipedia.org/wiki/Deterministic_acyclic_finite_state_automaton https://github.com/smhanov/dawg http://stevehanov.ca/blog/?id=115
fun related gemini post
https://nightfall.city/gemini/gemini.locrian.zone/collections/wtde.gmi