Archives

After solving the trivial coset [All positions that have the same orientation as the START position] published here Largest coset solved yet of actual Rubik's positions
I went ahead and calculated the full distribution of the flipped coset [All positions that have the same orientation as Reid's position (The only known 26q*)].

Enjoy:

Depth         Trivial coset           Flipped coset
0                         1                       0
1                         4                       0
2                        10                       0

hi,

let's say I want to distribute permutation checking over say 10 computers.
so if there are a total of n permutations the first machine will check n/10.
the second will check from n/10 to 2n/10
third will check from 2n/10 to 3n/10.
and so forth.
the algorithm that generates permtuations needs to generate the ith permutation in O(1)
so that I can efficiently start each machine's work.
what algos for generating permtuations do you know that can do this ?

thanks