ray5
Member
- Joined
- Oct 10, 2020
- Messages
- 39
Is there a mathematical reason why these algorithms are so similar?
T perm: R U R' U' R' F R2 U' R' U' R U R' F'
Y perm: F R U' R' U' R U R' F' R U R' U' R' F R F'
Jb perm: R U R' F' R U R' U' R' F R2 U' R' U'
I understand the F perm is just a conjugated T perm, but I don't really know about these 3. They all belong to a similar class: PLL, swaps 2 corners and 2 edges.
I was shown that Y = (F R U' R' U' R' F') (R U R' U' R' F R F')
and that T = (R U R' U' R' F R F') (F R U' R' U' R' F')
but I still don't know why a cycle shift of an algorithm would lead to another useful algorithm.
If we take out the conjugation by F in Y perm we have the following blocks:
T: (R U R' U' R' F R) (R U' R' U') (R U R' F')
Jb: (R U R' F') (R U R' U' R' F R) (R U' R' U')
Y': (R U' R' U') (R U R' F') (R U R' U' R' F R)
T perm: R U R' U' R' F R2 U' R' U' R U R' F'
Y perm: F R U' R' U' R U R' F' R U R' U' R' F R F'
Jb perm: R U R' F' R U R' U' R' F R2 U' R' U'
I understand the F perm is just a conjugated T perm, but I don't really know about these 3. They all belong to a similar class: PLL, swaps 2 corners and 2 edges.
I was shown that Y = (F R U' R' U' R' F') (R U R' U' R' F R F')
and that T = (R U R' U' R' F R F') (F R U' R' U' R' F')
but I still don't know why a cycle shift of an algorithm would lead to another useful algorithm.
If we take out the conjugation by F in Y perm we have the following blocks:
T: (R U R' U' R' F R) (R U' R' U') (R U R' F')
Jb: (R U R' F') (R U R' U' R' F R) (R U' R' U')
Y': (R U' R' U') (R U R' F') (R U R' U' R' F R)
Last edited: