Conjugated CxLL

From Wiki
Conjugated CxLL
Conjugated CxLL.png
Proposer(s): James Straughan, Joseph Briggs
Proposed: 2012 by James Straughan and 2017 by Joseph Briggs
Alt Names: (CxLL) Transformation, L5C reduction, Briggs Last Corners, BLC, BT-Redux, BTR
Variants: Transformation, L5C, L5CO, CxLL
No. Algs: 42
Avg Moves:
Previous state: F2L-1 cube state
Next state: unknown

F2L-1 cube state -> Conjugated CxLL step -> Next cube state

The Conjugated CxLL step is the step between the F2L-1 cube state and the Next cube state.

Conjugated CxLL is a way to solve the last five corners (L5C) using only 42 CxLL algorithms by conjugating them with an R move. (The used CxLL depends on the method.) It is a subset of Transformation.

It was invented independently by both James Straughan for his A2 method based on the development of a CLL transformation table[1] where Conjugated CLL is used and by Joseph Briggs for his 42 method based on Roux where Conjugated CMLL is used.


  1. When only five corners remain (four on U and one in DFR), orient one of them and place it at UBR.
  2. Perform an R move to bring all of the other four corners to the U layer.
  3. Recognize the case and perform the correct CxLL algorithm.
    1. Recognition works by associating multiple cases with one CxLL algorithm (see the last three links in #External links)
    2. The used CxLL subset is dependant on the method. For example in 42, where edges in U and M do not need to be preserved, CMLL is used. However in Zipper where the F2L-1 cube state needs to be preserved, 3x3 CLL may be used.
  4. AUF so that the corners are an R' away from being solved and then perform the R'.

Comparison with L5C


  • The amount of algorithms is reduced from 614 to only 42


  • More moves are required
  • Having to orient one corner and doing an R move makes this not fully one look
  • Recognition still needs to be learned for all cases
  • L4C (which has 84 algorithms and is usually considered one of the worst ZBLL subsets) is required for solving L5C as a last step (when everything except for five corners is solved)


  • CxLL algorithm sets that also twist a corner (TCLL, TCMLL, etc.) can be used so that the oriented corner in UBR isn't required anymore, which also lowers movecount a bit. However, this is at the price of 128 instead of 42 algorithms.

See also

External links