PURE Corner swap parity algorithms.

cuber

Member
Joined
Mar 13, 2009
Messages
3
I can't seem to find a pure algorithm that swaps corners diagonally and adjacently.

For switching across, I don't have a pure algorithm. (Rr' U2 Ll F2 Ll' F2 Rr2 U2 Rr U2 Rr' U2 F2 Rr2 F2)

For switching diagonal, I don't have an algorithm at all! Can someone please help me? Thanks.
 
I like this one for diagonal swap:
(L U L') (Uw2 Rw2 U2 r2 U2 Rw2 Uw2) y' (R U R' U' R' F R2 U' R' U' R U R' U' F')

I must have really messed up but that wasn't even close to working for me. I guess I just messed up when I saw the w notation. Thanks anyway, though! Replying just shows you're helping.
 
A pure corner swap doesn't exist, you have to swap two centers as well.
For a semi-pure (preserving solved centers but not unsolved ones) diagonal swap, you can use:
(Lw' U Rw' U2 Lw U' Rw)^2 U' x' U L' U l2 U' L U L2 U2 R U' R d2 R' U R d2 R2 x
(quite long but as close to pure as it is possible to get. It swaps only two U centers diagonally in addition to the corners.)
 
Adjacent
z r2 U2 R' U2 R' U2 R x U2 Rw2 U2 B2 L U2 L' U2 Rw2 U2 z' y' (17)

Diagonal
Rw2 F2 U2 y Rw2 U' Rw2 U D Lw2' U' Lw2' y' r2 U2 F2 Rw2 U (16)

EDIT:
A Diagonal which is a conjugate of the adjacent:
z Rw2 R' U2 R x U2 Rw2 U2 B2 L U2 L' U2 Rw2 U2 r2 x' U2 R' U2 Rw2 z' (19)

TMOY said:
quite long but as close to pure as it is possible to get
Yeah, as you have probably have already seen (but I am posting for Cüber), this is the shortest I have been able to get for swapping just two X-center pieces for the adjacent case:

r2 y r U l' u2 r U' 2R L2 x' 3d' 2R2 3d L' F' L 3d' 2R2 3d L' x U m U r2 y' (23)

EDIT:
Here is yet another type of algorithm for each case:
Note: The two bold moves can be inverted to achieve the same task.

Diagonal
Rw2 R U2 R U2 R' U2 Rw U2 Rw2 U2 Rw2 U2 Rw L U2 R' U2 R U2 L' Rw2 (22f)

Adjacent
z' x
Rw2 R' U2 Rw U2 Rw2 U2 Rw2 U2 Rw L U2 R' U2 R U2 R L' U2 R U2 Rw2 (22f)
x' z
 
Last edited:
Back
Top