Turns a five-letter word into a bit vector representing character coverage. Uses 26 letters by default.

Recursive private method called by assemble().

Pre-order depth-first traversal starting at the leaf nodes and proceeding upwards.

Assemble the trie from the set of words passed to the constructor.

Reconstruct the sequence of words that gives maximum coverage and minimum word count. Input: minimum word key (last word), minimum value (nu

Do a depth-first traversal of the entire trytrietree, pruning as we go. This is a pre-order traversal, meaning we traverse chi

Recursive backtracking method to assemble strings differing by +/-distance at each position

Return all possible words that differ from `word` by +/-distance in each index. This does not include `word` in the variations.

Given a string prefix, return the node that represents the tail end of that sequence of letters in this trie. Return N

Given a node in the trie, return the string prefix that would lead to that node.

Find pairs of SGB word vectors that differ by +/-distance in each component. To do this, iterate through each word, generate th

Compute and print a table of number of words n versus number of perfect tries formed.

Pretty printing for boolean bit vector