probabilistic spying; println profiling for `admissibles`
probabilistic spying; println profiling for `admissibles`

I had suspected that the reason we saw such a big speedup from using the
Cartesian product of what I've been calling "spot-admissibles" (even
though Cartesian products can get very expensive very fast) is because
the prefix trees thin out quickly enough such that there are fewer
prefix-admissible strings than the six-or-whatever thousand English
words of a given length. The crudely-collected ("collected") data
available after this commit seems to bear this intuition out: while
solving a 5x5 grid, words-fitting-across is of course constant at 5883,
whereas string-admissible-down is usually much smaller (mean 1207,
median 4, standard deviation 16173, maximum 308000; this from data
gathered, cleaned, and summarized from the println output through an
absurd multi-step procedure involving copy-paste, Emacs, grep, and
Python 3.4's statistics module; you can ask why I didn't just do it
sanely in Clojure in the first place but I'm sorry).

zackmdavis/xrosslexior