• Welcome to the Speedsolving.com, home of the web's largest puzzle community!
    You are currently viewing our forum as a guest which gives you limited access to join discussions and access our other features.

    Registration is fast, simple and absolutely free so please, join our community of 35,000+ people from around the world today!

    If you are already a member, simply login to hide this message and begin participating in the community!

Well known algs as commutators and conjugates

Joined
Sep 17, 2009
Messages
891
Likes
36
Location
New Orleans, LA
YouTube
4EverTrying
#2
Do you mean that we post a commutator, and when all moves are cancelled, it's a well-known algorithm?

Like the fact that Sune = [R U R2, R U2 R2]? Or are you asking us to find a single commutator solution to the position generated by a well-known algorithm (or the position of a OLL, PLL, etc.)?
 
Joined
May 24, 2016
Messages
381
Likes
147
YouTube
filipemtx
Thread starter #4
Do you mean that we post a commutator, and when all moves are cancelled, it's a well-known algorithm?

like this:

Like the fact that Sune = [R U R2, R U2 R2]? Or are you asking us to find a single commutator solution to the position generated by a well-known algorithm (or the position of a OLL, PLL, etc.)?
like this:

T perm = [l, F R' F'] [F R U' R', U']
A perm = [l', [U, R' D2 R]]
U perm = [M2 U': [M, U2]]
cases and the commutator/conjugate notation of the solution
 
Joined
Sep 17, 2009
Messages
891
Likes
36
Location
New Orleans, LA
YouTube
4EverTrying
#5
Well in 2012, I did write every odd permutation PLL which was in the wiki at the time as a composition of commutators and conjugates. But my work was deleted last year (I guess for the best). However, you can see them it in this revision. This is the original topic I started which I eventually just brought to the PLL wiki page.

(Basically, I removed all cube rotations, wide turns, slice moves, etc., from all algorithms for 2-cycle PLLs in the wiki. I then expressed that face-turn algorithm as a composition of commutators and conjugates.)

Not all of the decompositions are good, but at least we can improve on them.

I doubt any well-known/speedsolving G perm algorithm can be written as a single commutator, but here is a single commutator that I found for the G perm position.
G perm = [F' R' F U2 F' R F, R' U' R L' D L F' D R F]
 
Last edited:
Joined
May 24, 2016
Messages
381
Likes
147
YouTube
filipemtx
Thread starter #6
Cool, I find this very interesting.
I believe people in the 80 used some commutator/conjugate techniques to find most of the OLL and PLL they used. Later on entered the brute force algorithms, and that way of finding algs ended.
 
Joined
Dec 24, 2015
Messages
1,481
Likes
940
#8
A large portion of the 2GLLs and diag ZBLLs can be solved with a conjugated sexy move (or sledgehammer, which amounts to the same thing).

The easiest example is Sune: R U R' U R U2 R' = [R U R' : [U, R]]. Another one is [r U2 R' : [R', F]] (one of the common diag-L COLL algs; rearranging this a bit gives the x R2 F R F' Ja perm alg that a few people use). Looking outside of ZBLL, we also have [F : [R, U]] and [R' U' : [R', F]], among a few others.

Some algs are conjugated single moves, e.g.
[R U' R2 D' r : U2] (from COLL/ZBLL)
[r' D R2 U R' : U2] (from OLLCP)
[R U' R2 B2 D' r : U2] (an optimal N perm alg)
[r' D B2 R2 U R' : U2] (an optimal 4-flip N perm alg)
[F U' R2 D R' : U2] (from OLLCP/flipped line 1LLL)
[r u' R2 u r' : U2] = [L B' D2 B L' : U2] (optimal corner twist alg)
[r U' M2 U r' : U2] (from ELL)
[R' U2 r U' r' : U2] (from OLL)
[M' U' M U' M' : U2] (from ELL)
[F R U' R' : U'] and inverse (from OLL/OLLCP)

These all use a bunch of moves to shuffle the top layer pieces (messing up F2L along the way), do a U/U2/U' move to permute them, then restore F2L. It's theoretically possible to get algs for most (unfortunately, not all) 1LLL cases this way, although it goes without saying that such algs aren't necessarily good (e.g. that N perm listed above).

Some algs can be decomposed into a simpler alg with inserted commutators, e.g. the RUD R perms: R U2 R D R' U R D' R' U' R' U R U R' = [R U2 : @ [R', U]] with @ = [R D R', U].
 
Joined
Sep 3, 2017
Messages
27
Likes
11
#9
Here are three methods for manipulating the Up layer using conjugation. They're not optimal but they're easy to remember.

Three corner cycle

F D' F'
U
F D F'
U
F D' F'
U2
F D F'

Three corner cycle with corner twist

F D' F'
U
R' D' R
U
R' D R
U2
F D F'

Edge-corner three cycle

L' F L
U
L' F' L
U
L' F L
U2
L' F' L

There are analogous transforms for the edges. Here's the Three Edge Cycle maneuver.

R L' F L R'
U
R L' F' L R'
U
R L' F L R'
U2
R L' F' L R'

Or if you like, using middle slice turns.

MR' D MR
U
MR' D' MR
U
MR' D MR
U2
MR' D' MR
 
Last edited:
Top