Thanks everybody for the suggestions. I'm testing them out, and looking at BrowserUK's idea of trying to get around the permutation with statistics: the general problem is mathematically unsolvable (it breaks down to a large set of recurrence relations, I've been told), but some of his ideas might be dramatically more efficient. Thanks again -- I'm overwhelmed by the responses.
-TatsIn reply to Re: Performance Tuning: Searching Long-Sequence Permutations
by Itatsumaki
in thread Performance Tuning: Searching Long-Sequence Permutations
by Itatsumaki
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |