@mbr
Ah thanks.
I'm thinking about doing a "golden ratio shuffle" where you multiply phi by N (the number of items to shuffle), cast to integer, then search for the nearest coprime to do the repeated addition and modulus thing.
It makes it be less accurate phi, but always maximal length if my thinking is right :P