Search results
From Speedsolving.com Wiki
- * L R' L' R' y R' L' R * L R' L' R ...1 KB (201 words) - 09:27, 2 May 2026
- == U L == ...cases, [[CxLL U R|U R]], [[CxLL U L|U L]], [[CxLL L L|L L]] and [[CxLL L F|L F]] are mirrors and inverses of each other so the same algorithm (9 move co ...823 bytes (168 words) - 19:40, 13 June 2011
- == L B == ...cases, [[CxLL T R|T R]], [[CxLL T L|T L]], [[CxLL L R|L R]] and [[CxLL L B|L B]] are mirrors and inverses of each other so the same algorithm (8 move co ...683 bytes (133 words) - 23:50, 31 December 2009
- U R' U' R U' R' U2 R' Y R U2 R' U' R U R' R (U R' U) y' (R' U) (R U') (R2 F) (R F' R) ...1 KB (425 words) - 22:03, 6 January 2015
- == Pi L == || [[image:CxLL pi L.jpg|128px|]] ...994 bytes (222 words) - 20:30, 23 January 2010
- * (y) R F' U' R2 (y) L U' L' U (y') R2 U F R' ... setup <sexy move> unsetup * (y) R F' U' R2 (y) L U' L' d R2 d l U' (x) ... same, a little optimised ...1 KB (306 words) - 02:51, 8 May 2011
- ...cases, [[CxLL U R|U R]], [[CxLL U L|U L]], [[CxLL L L|L L]] and [[CxLL L F|L F]] are mirrors and inverses of each other so the same [[algorithm]] (9 mov ...ere one colour is common for both (in the image, green). Case [[CxLL U L|U L]] looks the same but mirrored. ...821 bytes (166 words) - 20:29, 18 June 2011
- ...-LB, if the diagonal is at LF-RB then it is the mirror case [[CxLL Pi L|Pi L]]. * (y) R U2 R' U' R U R' U2 L' U R U' M' (x') ... double [[Sune|Antisune]] but ended diffrently. ...1,018 bytes (234 words) - 20:27, 23 January 2010
- == L D == || [[image:CxLL L D.jpg|128px|]] ...840 bytes (187 words) - 10:41, 25 June 2024
- == T L == ...cases, [[CxLL T R|T R]], [[CxLL T L|T L]], [[CxLL L R|L R]] and [[CxLL L B|L B]] are mirrors and inverses of each other so the same algorithm (8 move co ...753 bytes (148 words) - 23:54, 31 December 2009
- * (y2 x) M U R' U' L U2 R U L' U R' U' L ... undo pair + [[Niklas]] * (y2 x) F R' F' R U2 R U L' U R' U' L ... FR'F'R + [[Niklas]] ...630 bytes (136 words) - 20:25, 16 January 2010
- * R d' R' U R d R' (y') L' U2 L * L' d L U' L' d' L (y) R U2 R' ... mirror ...1,003 bytes (209 words) - 18:46, 10 August 2010
- '''O'''rient '''L'''ast '''C'''orners (OLC), also known as '''O'''rient '''L'''ast '''4''' '''C'''orners (OL4C), is a subset of OLL used in [[ZZ-reducti {{Alg|R U' L' U R' U' L|OLL}} ...4 KB (929 words) - 16:58, 28 March 2020
- ...Permutation : a|N PLL]], [[PLL#V Permutation|V PLL]], [[PLL#Y Permutation|Y PLL]] * R U' r' d' L2 D' L U L' D L2 ...1,003 bytes (208 words) - 02:23, 25 June 2024
- * R' U R U2 (L' R') U R U' L * R' U R U2 Ra' U R U' L ... same but Ra notation ...709 bytes (157 words) - 10:40, 25 June 2024
- == L U == || [[image:CxLL L U.jpg|128px|]] ...1 KB (231 words) - 10:41, 25 June 2024
- * (y) R U2 R2 U' R2 U' R2 U2 R ... the standard [[OLL]] for this case, ([[Bruno] * (y') F U R U' R' F2 L' U' L U F ...1 KB (293 words) - 20:32, 16 January 2010
- ...cases, [[CxLL T R|T R]], [[CxLL T L|T L]], [[CxLL L R|L R]] and [[CxLL L B|L B]] are mirrors and inverses of each other so the same algorithm (8 move co * (y') r' U' R U L U' R' U (x) ...752 bytes (145 words) - 23:56, 31 December 2009
- * (y) L' U2 L U L' U L R U2 R' U' R U' R' ... left + right Antisune, preserves edges permutation * (y x) U2 L U L' U Ra U2 R' U' R U' Ra' (x') ... same but first turn last so two Ra's are p ...1 KB (295 words) - 20:47, 31 December 2009
