> consider a window of (say) 6 keys and ask if any of the 6! permutations of them are better
I imagined something similar - since we can reasonably assume that XJQZKV are doing to be at the outer edges, we can take it from 26! to 6!20!. But even constraining it as much as possible, we still end up with 6!6!6!8! and 29 years of searching.
But I'll definitely give the sliding window approach a go, yeah.
I imagined something similar - since we can reasonably assume that XJQZKV are doing to be at the outer edges, we can take it from 26! to 6!20!. But even constraining it as much as possible, we still end up with 6!6!6!8! and 29 years of searching.
But I'll definitely give the sliding window approach a go, yeah.