• Welcome to SpeedSolving.com — the world’s largest puzzle community!

    You’re currently browsing as a guest, which means you have limited access to discussions, resources, member profiles, and community features.

    Join 50,000+ cubers and puzzle enthusiasts from around the world to ask questions, share solves, improve faster, and be part of the community.

    Registration is free, fast, and easy — create your account today.

    Already a member? Log in here to hide this message and start participating.
Adjacent two corner swap

a. Rw' U' R U r U' R' U R2 U R' U' r U R U' Lw Uw2 Rw' U' Rw Dw2 Rw' U Rw' F'
b. Rw' U' R U r U' R' U R2 U R' U' r U r' F' Rw U Rw' U' Rw' F Rw2 U' Rw' U'
c. Rw' U' R U r U' R' U R2 U R' U' r U r' U' Rw' F Rw2 U' Rw' U' Rw U Rw' F'

Useful for 444 and 666 (and 888 etc)
 
Adjacent two corner swap

a. Rw' U' R U r U' R' U R2 U R' U' r U R U' Lw Uw2 Rw' U' Rw Dw2 Rw' U Rw' F'
b. Rw' U' R U r U' R' U R2 U R' U' r U r' F' Rw U Rw' U' Rw' F Rw2 U' Rw' U'
c. Rw' U' R U r U' R' U R2 U R' U' r U r' U' Rw' F Rw2 U' Rw' U' Rw U Rw' F'

Useful for 444 and 666 (and 888 etc)
Decomposition(a) = [Rw: [r': [R2: [r', U' R U] ] [U R' U', r] ] [y2: [Rw: [Dw2, Rw' U' Rw] ] [Rw': (F')] ] ] (29,26)

Decomposition(b) = [Rw: [r': [R2: [r', U' R U] ] [U R' U', r] ] [U Rw': [F' Rw U, Rw'] [Rw U' Rw': (U')] ] ] (28,26)

Decomposition(c) = [Rw: [r': [R2: [r', U' R U] ] [U R' U', r] ] [Rw' F: [F' Rw U, Rw'] [Rw U' Rw': (U')] ] ] (28,26)

Using the parity algorithm [U': [Lw U Lw' U', Rw] [U Rw: (U)] ] instead (just for my curiosity),

Adjacent
Rw U R' U' r' U R U' R2 U' R U r' U' R' Lw U Lw' U' Rw U Lw U' Lw' Rw' U Rw U (29,28)

If Robert(b) is shifted, only one set up move needs to be added to make an opposite case.
F Rw' F Rw2 U' Rw' U' Rw' U' R U r U' R' U R2 U R' U' r U r' F' Rw U Rw' U' F' (30,28)

And just to let those who don't know, these 2-corner swap algorithms only exchange 2 X-center pieces on the 4x4x4 (or \( \frac{\left( n-2 \right)^{2}}{2} \) center pieces on the nxnxn even cube).

Here are the shortest algorithms I have found. As you will see, assuming that the solutions below are optimal, Robert's algorithms are only a few more moves than the optimal ones for this category of algorithms.
Adjacent

[1]
L Bw2 Dw2 Bw U Bw' Dw2 Bw U' F2 b L' d2 L F' U' F L' d2 L F' U S z' (29,23)

= [L Bw2: [Dw2, Bw U Bw'] [Bw2: L] ] [B' F: [F L' d2 L F', U'] ]
=
L Bw2
Dw2 Bw U Bw' Dw2 Bw U' Bw'
Bw2 L Bw2
Bw2 L'
B' F
F L' d2 L F' U' F L' d2 L F' U
F' B
[2]
Fw' L2 Uw F' U R U' F r2 F' U R' U' F r2 Fw Uw' L Uw Fw' Uw' L Fw L (27,24)
= [Fw' L2 Uw: [F' U R U' F, r2] [Uw' L: [L', Uw Fw Uw'] [L Fw: L] ] ]
=
Fw' L2 Uw
F' U R U' F r2 F' U R' U' F r2
Uw' L
L' Uw Fw Uw' L Uw Fw' Uw'
L Fw L Fw' L'
L' Uw
Uw' L2 Fw
[3]
Fw' L2 Uw r2 F' U R U' F r2 F' U R' U' F Fw Uw' L Uw Fw' Uw' L Fw L (27,24)
= [Fw' L2 Uw: [r2, F' U R U' F] [Uw' L: [L', Uw Fw Uw'] [L Fw: L] ] ]
=
Fw' L2 Uw
r2 F' U R U' F r2 F' U R' U' F
Uw' L
L' Uw Fw Uw' L Uw Fw' Uw'
L Fw L Fw' L'
L' Uw
Uw' L2 Fw

Opposite


[1]
F r2 F' U R' U' F r2 Fw Uw' L Uw Fw' Uw' L Fw L Fw' L2 Uw F' U R U' (27,24)
= [U R' U' F: [F' U R U' F, r2] [Uw' L: [L', Uw Fw Uw'] [L Fw: L] ] ]
=
U R' U' F
F' U R U' F r2 F' U R' U' F r2
Uw' L
L' Uw Fw Uw' L Uw Fw' Uw'
L Fw L Fw' L'
L' Uw
F' U R U'
 
A list of all 15 btm "pure" one dedge flips

I don't know if this has been done before (probably, but I don't know where it is mentioned on the web), but I am going to list all of the UNIQUE 15 btm "pure" one dedge flip algorithms.

Clément Gallet listed all possible 15 btm solutions 3.5 years ago (it was probably done well before that though) in this post. I translated all of the algorithms in his list to WCA notation, and I rotated all of them so that they affect the FU dedge and the U center.

Eliminating exact duplicates (which were many), here is the "complete" list (the mirrors and inverses are also possible solutions).

Note:
There are only 4 unique algorithms which flip the FU dedge and affect the top center. All other algorithms are transformations (or mirrors or inverses). Hence, I list them showing how the algorithms are directly related.

Symmetrical Algorithms (16)
r2 B2 U2 l U2 r' U2 r U2 F2 r F2 l' B2 r2|Alg.1(v1)|
r2 B2 U2 l U2 l' B2 r B2 U2 r U2 r' B2 r2|Alg.1(v2)|
r2 F2 D2 r' D2 r F2 l' F2 D2 l' D2 l F2 r2|Alg.1(v3)|
r2 F2 D2 r' D2 l D2 l' D2 B2 l' B2 r F2 r2|Alg.1(v4)|
r2 B2 U2 r B2 r' B2 l U2 F2 r F2 l' B2 r2|Alg.1(v5)|
r2 F2 D2 l' F2 l F2 r' D2 B2 l' B2 r F2 r2|Alg.1(v6)|
r2 B2 U2 r B2 l' D2 r D2 B2 l U2 r' B2 r2|Alg.1(v7)|
r2 F2 D2 l' F2 r U2 l' U2 F2 r' D2 l F2 r2|Alg.1(v8)|

r2 B2 U2 l' U2 r U2 r' U2 B2 r' B2 l B2 r2|Alg.2(v1)|
r2 B2 U2 l' U2 l F2 r' F2 U2 r' U2 r B2 r2|Alg.2(v2)|
r2 F2 D2 r D2 r' B2 l B2 D2 l D2 l' F2 r2|Alg.2(v3)|
r2 F2 D2 r D2 l' D2 l D2 F2 l F2 r' F2 r2|Alg.2(v4)|
r2 B2 U2 r' F2 r F2 l' U2 B2 r' B2 l B2 r2|Alg.2(v5)|
r2 B2 U2 r' F2 l D2 r' D2 F2 l' U2 r B2 r2|Alg.2(v6)|
r2 F2 D2 l B2 r' U2 l U2 B2 r D2 l' F2 r2|Alg.2(v7)|
r2 F2 D2 l B2 l' B2 r D2 F2 l F2 r' F2 r2|Alg.2(v8)|

Non-Symmetrical Algorithms (10)
r' U2 l F2 l' F2 r2 U2 r U2 r' U2 F2 r2 F2 |Frédérick Badie (v1)|
r' U2 r U2 l' U2 l2 F2 r F2 l' U2 F2 r2 F2 |Frédérick Badie (v2)|
r B2 r' U2 r U2 r2 F2 r' D2 l D2 B2 r2 F2 |Frédérick Badie (v3)|
r B2 r' U2 r U2 l2 B2 r' U2 l U2 F2 l2 F2 |Frédérick Badie (v4)|
r B2 l' B2 l U2 r2 F2 l' F2 r U2 F2 l2 F2 |Frédérick Badie (v5)|

r B2 r' U2 l B2 l2 B2 U2 l U2 l' U2 l2 B2 |Alg.2(v1)|
r B2 r' U2 r D2 r2 U2 F2 l F2 r' D2 r2 B2 |Alg.2(v2)|
r B2 r' U2 r D2 l2 D2 B2 l B2 r' U2 l2 B2 |Alg.2(v3)|
r B2 l' B2 l D2 l2 D2 B2 r D2 l' D2 r2 B2 |Alg.2(v4)|
r' U2 r U2 l' D2 r2 D2 B2 l' D2 r D2 l2 B2 |Alg.2(v5)|

Thus there are exactly 26 (52 if you including mirrors and 104 if you also include inverses) one dedge flip 15 btm algorithms which flip the FU dedge and affect the top center.

And actually,
[1] Shifting any of the symmetrical algorithms from the first group and adding back the two setup moves yields algorithms from the second group. (and vice versa).
[2] Shifting any of the non-symmetrical algorithms from the first group yields algorithms from the second group (and vice versa).

*Therefore, in reality, there are only two unique paths for 15 btm move solutions: Frédérick Badie and the (old) standard algorithm. This has been my guess for a while, but I wasn't absolutely sure until I looked at all possible solutions and found relationships between them.

Would it be too much if I list all 26 of these algorithms here? (Two of them are there already).
[wiki]Impure Dedge Flips with Wide Turns/Pure Flips with Inner Layer Turns (SiGN Notation)[/wiki]
 
Weird G perm?

http://www.speedsolving.com/wiki/index.php/PLL#G_Permutation_:_c

if you look at that, that's the Gc perm, right? well, idk all of the Gperms, but one i keep running into is like the Gc, but if you see, on the Gc the solved 1x2x2 block thingy is in the left when the headlights are on the front. the one i keep seeing is headlights front, but the solved block is on the RIGHT! is this the same? is there another algorithm? help much appreciated.
 
Different alg

Block on the left: R U R' (y) R2 u' R U' R' U R' u' R2

On the right: F' U' F R2 u R' U R U' R u' R2'
 
Last edited:
thanks!! and you're Matt from that cube meet up in the coffeeshop, right?
also, wouldn't that mean that there's 5, not 4 g perms?

Yeah I'm matt. You're the one with the glasses, correct? And no there are four.

Gd (block on left; headlights back (if block facing you)): R U R' (y') R2 u' R U' R' U R' u R2
Gc (block on left; headlights on right (if block facing you)): R2' u' R U' R U R' u R2 f R' f'
Gb (block on right; headlights back (if block facing you)): F' U' F R2 u R' U R U' R u' R2'
Ga (block on right; headlights left (if block facing you)): R2' u R' U R' U' R u' R2 F' U F
 
Back
Top