Load dict.dat before starting

Wildcards are implemented but increase a lot the precomputing complexity

The precomputation time has a complexity if \(\mathcal{O}(\sum_{i=0}^W \binom{S}{i} . n)\) where \(S\) is the maximum size of the words, \(W\) the maximum number of wild card, and \(n\) the size of the dictionary. For \(S = 15\) and \(W = 3\), this is more or less \(500 . n\)

The wildcard caracter is '?'

Sources in rust are available here

TODO:

• Allow query-time resolution of wild cards when there are more wildcards than the number of precomputed wild cards