guysensei1
Legend
U R U R' U' M2 U R U' R' M2 U' ?Alg to cycle DF UB UL. It would be preferred to have it rotationless and Consisting of RUD and M moves if at all possible. Thanks![]()
Follow along with the video below to see how to install our site as a web app on your home screen.
Note: This feature may not be available in some browsers.

U R U R' U' M2 U R U' R' M2 U' ?Alg to cycle DF UB UL. It would be preferred to have it rotationless and Consisting of RUD and M moves if at all possible. Thanks![]()
ThanksU R U R' U' M2 U R U' R' M2 U' ?
[D R2: (Uperm)]Alg to cycle DF UB UL. It would be preferred to have it rotationless and Consisting of RUD and M moves if at all possible. Thanks![]()
9 moves is optimalAny sub 8 move Aa perms? If not ill like to know any u guys use
Thanks![]()
Whats ur alg?9 moves is optimal
tyThere are two nine move Aa perms on Alg.db
OH CMLL:
![]()
Nobody I've asked seems to have anything better than F R2 D R' U R D' R2 U' F'. Anybody else have anything?
[D’ B D, F’] is what I would use for this case, make sure you are inserting and interchanging not just the piece but also each sticker to the right spot.I'm trying to learn some cube theory to help with FMC, and I've ended up with an unusual cycle:
(FDR LFU LUB DRF)
For the 3-corner cycles I've solved using commutators, the first and last stickers have been the same.
I came up with:
A: U R2 U'
B: L'
It is then applied in the order: B A B' A' resulting in: L' U R2 U' L U R2 U'
All the corners end up in the right place, but the DRF and UBR corners are mis-oriented.
Any help would be really appreciated, I'm really finding this interesting!
It's called anti-ZBLL and at least one person learnt all of it, but I don't think there's any good list of algs. This is partly because many cases just don't have good algs; no RUF last layer alg with at most two F-face moves can flip four edges, and likewise for RrU with at most two r moves. (Compare ZBLL, which can always be done RUL, RUD, or RUF with at most two non-RU moves.)Is there a list of algs for the 1LLL cases where all 4 edges are unoriented? If not then I could make one.
![]()
Solve these cases. You may mix the white and yellow colors in your algorithms. After that, separation and PBL should remain.