Try all permutations when searching.
Try all permutations when searching.

The previous attempt to avoid re-testing cycles would miss some candidates.
Unless we can come up with something which tests everything and retests
nothing, we're stuck with the simplest search: at least we can divide the
number of loops by n.

rutgers-apl/alive-loops,rutgers-apl/alive-loops,rutgers-apl/alive-loops,rutgers-apl/alive-loops