algs that goes back to solved position after X times

[nitay6669]

a challenge was set on the israeli forums, to find algororithms that goes back to solved position after X times of doing them.

X is going from 1 to whatever...
so far we have come out with 1-10 and 12 without 11.

i thought about trying to make an 11 cycle?
and generally its a fun challenge.

here is the list so far:

Spoiler:

1 :U4
2 : U2
3 : R U R' U' R' F R F'
4 : R U' R'
5 : R U R' U
6 : R U R' U'
7 : U R U' F
8 : U D R2
9 : U R F2
10 : U R U' F2
11 :
12 : R U2 R' U'

[y235]

I have a one that it's need to be repeated 11 times:
B' R' L M' U M U' R L' B z' M' U M U' y x y' (U PERM) z2

[nitay6669]

did you check if it works?
and why didnt you wrote it in the israeli forums?

[y235]

did you check if it works?
and why didnt you wrote it in the israeli forums?

it works, this is an 11 cycle of edges made of 2 5 cycles and one 3 cycle

[James Ludlow]

It seems to work.

How the hell did you find this?

EDIT - this alg takes forever to watch btw

[y235]

It seems to work.

How the hell did you find this?

EDIT - this alg takes forever to watch btw

2 5 cycle connected by a 3 -cycle.
B' R' L M' U M U' R L' B - 5 cycle of M and one edge in R
z' M' U M U' - 5 cycle of the R edges and one in L
y x y' (U PERM) z2 - connect them with 3 -cycle and restore to original orientation


I have another one with only UPERMS :P

[Jakube]

B' R' L M' U M U' R L' B z' M' U M U' y x y' (U PERM) z2

Here´s the optimal one (generated with Cube Explorer): F2 L' D' L R2 B' R F D B D2 U' R D' U (15f*)

[Kirjava]

Optimal? I seriously doubt that that's the shortest alg that returns to solved after 11 moves.

[riffz]

Optimal? I seriously doubt that that's the shortest alg that returns to solved after 11 moves.

I think he means the optimal alg for y235's cycle.

[Kirjava]

Of course. I'm just establishing that that doesn't mean it's the shortest for that criteria.