Quippiuq – cryptoquip and cryptogram solver

For n=1 this reduces to "e is most common, t is second most common..." except with the caveat that the simulated annealing algorithm is stochastic and will explore 'almost-perfect' decode tables as opposed to just the 'perfect' decode table (which might not actually be correct).

At n=2 or n=3 this strategy will chew up any substitution-cipher'd block you feed it (assuming a reasonably well-behaved plaintext).

EDIT: this was stochastically generated by a n=4 model, in case it helps you form a picture of how good they are at determining how "english-like" something is.

    % GAHLUABLEST ME BUCK NIGH GROUBLE ANY OLD A
    % WORRIES BEAUTIFFEEL AND AND WHY COME FOR SOON
    % I SEE IT DOWHEN WE PAY YEAR AT WHAH AND PULL YOU
    % COMING ALLOW NECTLY SCOW DOWN AFTS DUKE TOWARNT AND
    % SIXTEEN WA