• 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.
Status
Not open for further replies.
Hi, I am looking for an algorithm subset that solves corner permutation and edge orientation when inserting the last f2l pair (The last f2l pair is already paired up in a block or the 3 mover insert, like in Winter Variation and Summer Variation respectively). In other words, I want to get a 2GLL in the last layer. Does such a subset of algs exist, and I dont think ZBLS is what I am looking for?
 
Hi, I am looking for an algorithm subset that solves corner permutation and edge orientation when inserting the last f2l pair (The last f2l pair is already paired up in a block or the 3 mover insert, like in Winter Variation and Summer Variation respectively). In other words, I want to get a 2GLL in the last layer. Does such a subset of algs exist, and I dont think ZBLS is what I am looking for?
What you're looking for doesn't exist but I can tell that it will have more algs than ZBLS, ZBLL and VLS combined.
 
You can turn almost any CPEOLL alg into an LS insert: When inserting the last pair, cancel into the CPEOLL alg. This is suboptimal in many cases, but some could be quite good.

Now, I'm looking for algorithms in a similar vein to this topic: Altcross OLL. In that thread, they discuss OLL algorithms where FD and BD are swapped (orientation maintained). I'm also curious about OLL's and F2L control with this setup, but I'm more interested in PLL.

Instead of bumping a decade old thread stump, I'm reaching out here for optimal and/or speed optimal solutions to each PLL case, but predicated with: (AUF) {M2 U2 M2}. Some pairs of PLL cases share an identical U-layer after performing the predicate (ie. V | Y, Ja | Gb etc.). I'm not sure which cases are equivalent (separated only by an AUF), so I'll post more setup cases than is probably necessary.

Without further ado, here're the setups for the cases I am referencing. Note the similarities between each pair, so the algorithms will be quite similar. Even just a single alg, or any pointers would be much appreciated:

Z's:
Setup: {(M2 U2 M2) (M2 U' M2 U' M' U2 M2 U2 M')}
Setup: {(M2 U2 M2 U) (M2 U' M2 U' M' U2 M2 U2 M')}

U's:
Setup:{(M2 U2 M2) (M2 U M' U2 M U M2)}
Setup:{(M2 U2 M2 U) (M2 U M' U2 M U M2)}

A's:
Setup: {(M2 U2 M2) (x R' U R' D2 R U' R' D2 R2 x')}
Setup: {(M2 U2 M2 U) (x R' U R' D2 R U' R' D2 R2 x')}

E's
Setup: {(M2 U2 M2) (x' R U' R' D R U R' D' R U R' D R U' R' D' x)}
Setup: {(M2 U2 M2 U) (x' R U' R' D R U R' D' R U R' D R U' R' D' x)}

T's:
Setup: {(M2 U2 M2) (R U R' U' R' F R2 U' R' U' R U R' F')}
Setup: {(M2 U2 M2 U) (R U R' U' R' F R2 U' R' U' R U R' F')}

F's:
Setup: {(M2 U2 M2) (R' U R U' R2 F' U' F U R F R' F' R2)}
Setup: {(M2 U2 M2 U) (R' U R U' R2 F' U' F U R F R' F' R2)}

Ja's:
Setup: {(M2 U2 M2) (L' U' L F L' U' L U L F' L2 U L)}
Setup: {(M2 U2 M2 U) (L' U' L F L' U' L U L F' L2 U L)}

Jb's:
Setup: {(M2 U2 M2) (R U R' F' R U R' U' R' F R2 U' R')}
Setup: {(M2 U2 M2 U) (R U R' F' R U R' U' R' F R2 U' R')}

Ga's:
Setup: {(M2 U2 M2) (R2 u R' U R' U' R u' R2 F' U F)}
Setup: {(M2 U2 M2 U) (R2 u R' U R' U' R u' R2 F' U F)}

Gb's:
Setup: {(M2 U2 M2) (R' d' F R2 u R' U R U' R u' R2)}
Setup: {(M2 U2 M2 U) (R' d' F R2 u R' U R U' R u' R2)}

Gc's:
Setup: {(M2 U2 M2) (R2' u' R U' R U R' u R2 f R' f')}
Setup: {(M2 U2 M2 U) (R2' u' R U' R U R' u R2 f R' f')}

Gd's:
Setup: {(M2 U2 M2) (D' R U R' U' D R2 U' R U' R' U R' U R2)}
Setup: {(M2 U2 M2 U) (D' R U R' U' D R2 U' R U' R' U R' U R2)}

Ra's:
Setup: {(M2 U2 M2) (L U2 L' U2 L F' L' U' L U L F L2)}
Setup: {(M2 U2 M2 U) (L U2 L' U2 L F' L' U' L U L F L2)}

Rb's:
Setup: {(M2 U2 M2) (R' U2 R U2 R' F R U R' U' R' F' R2)}
Setup: {(M2 U2 M2 U) (R' U2 R U2 R' F R U R' U' R' F' R2)}

V's:
Setup: {(M2 U2 M2) (R' U R' U' y R' F' R2 U' R' U R' F R F)}
Setup: {(M2 U2 M2 U) (R' U R' U' y R' F' R2 U' R' U R' F R F)}

Y's:
Setup: {(M2 U2 M2) (F R U' R' U' R U R' F' R U R' U' R' F R F')}
Setup: {(M2 U2 M2 U) (F R U' R' U' R U R' F' R U R' U' R' F R F')}

N's:
Setup: {(M2 U2 M2) (F' R U R' U' R' F R2 F U' R' U' R U F' R')}
Setup: {(M2 U2 M2 U) (F' R U R' U' R' F R2 F U' R' U' R U F' R')}
Happy thanksgiving!
 
Now, I'm looking for algorithms in a similar vein to this topic: Altcross OLL. In that thread, they discuss OLL algorithms where FD and BD are swapped (orientation maintained). I'm also curious about OLL's and F2L control with this setup, but I'm more interested in PLL.

Instead of bumping a decade old thread stump, I'm reaching out here for optimal and/or speed optimal solutions to each PLL case, but predicated with: (AUF) {M2 U2 M2}. Some pairs of PLL cases share an identical U-layer after performing the predicate (ie. V | Y, Ja | Gb etc.). I'm not sure which cases are equivalent (separated only by an AUF), so I'll post more setup cases than is probably necessary.
This isn't what you asked, but: just solve the cross normally. You can M2 U2 M2 to influence F2L pairs, OLL, or PLL, but the average time saved from this influencing is less than the time added by having to do M2 U2 M2. (On very rare occasion this might make sense, e.g. you have a very easy "xxcross" except with a wrong cross.)

Getting to the actual answer: Besides prepending M2 U2 M2, you can also append it. This is basically the same as how PLL parity is dealt with on big cubes, so you can look to PLL parity algs (e.g. on CubeSkills or SCDB) for some inspiration. (Not all of the algs can be adapted to fixing wrong-cross PLL.) For instance, you never need to get a G perm. Any case where you can get a G perm by doing M2 U2 M2 first, you can do M2 U2 M2 from a different AUF and get J perm or R perm.

The edge-only PLLs are also good to know direct algs for, since they're easy and mostly pretty fast:
Opposite: M2 U2 M2
Adjacent: R U R' U M2 U2 M2 U R U' R'
W perm: M2 U' M' U2 M U M2
Ocw perm: M U' M2 U' M2 U' M'
Occw perm: M U M2 U M2 U M'
 
The edge-only PLLs are also good to know direct algs for, since they're easy and mostly pretty fast:
Opposite: M2 U2 M2
Adjacent: R U R' U M2 U2 M2 U R U' R'
W perm: M2 U' M' U2 M U M2
Ocw perm: M U' M2 U' M2 U' M'
Occw perm: M U M2 U M2 U M'
The goal with the opp-swap altcross setup is to allow for easier lookahead into F2L (which includes X-cross). Sometimes the cross-fix alg can be performed in F2L to form a pair, while also giving a good next case. And because the cross-fix alg only swaps 2 pieces on the U-layer, this makes it easier to look ahead to the next case.

The cross-fix alg can be performed at any point during the solve, so the cuber has plenty of time to prepare for the slice moves. But if the cuber saves the fix for PLL and the corners are solved or adj-swap, they could also opt to solve edges and finish the solve with an A-perm.

That's why I'm reaching out. My first goal is to make a 2-look PLL with cross fix + EPLL, then CPLL. But for diag-swap corner cases, it must be better to perform a single algorithm. So I am also searching for cross fix + CPLL algs, which can be followed up by EPLL to finish. It also occurred to me that cross fix + ELL followed up by L3C (or vice versa) would make for a pretty nice LL (for when corner perm is adj/solved and at least 1 corner is oriented). So I'm glad you provided these algs, and I'll look into those resources even though I am always befuddled by 4x4 parity!
 
teri's random 1LLL subsets

It's on the first sheet(ignore the titles they're a bit weird)

EDIT: lol nvm it's incomplete
Thanks; that sheet was really helpful! I'd been looking for 1LLLs for a while, especially pure cases.

EDIT: Yes, I know that it wasn't technically meant for me, but it was helpful nonetheless...
 
Where can I find the most up to date Tripod LL algs. I am aware that I can just use SCDB but I'd just like to check to see if there is already a document ready to go.

Edit: Just curious, how many algs would it be for Tripod+1 where the 1 represent DFR not being solved?
found the tripod ZBs but you might have to look up SCDB for the other cases.
(btw the images aren't working)
 
found the tripod ZBs but you might have to look up SCDB for the other cases.
(btw the images aren't working)
I was actually looking for ZB cases only given that I (as of one hour in the future) use Petrus-APB so learning full Tripod wouldn't be beneficial for me. I don't think that the lack of images will be a problem since the doc tells you the permutation of the pieces.

Thank you!
 
Last edited:
Hi, does anyone know if there are algorithms that solves 2 F2L pairs at the same time? In other words, algorithmic multislotting. (I know the number of cases is in the upwards of the thousands)
 
Hi! I just learned the s move u perms, and they help improve my times a lot. I was wondering if there is a s move alg for an h perm, thanks!
 
Where can I find the most up to date Tripod LL algs. I am aware that I can just use SCDB but I'd just like to check to see if there is already a document ready to go.

Edit: Just curious, how many algs would it be for Tripod+1 where the 1 represent DFR not being solved?

I've already made a pfp about this but decided to make a post on the forums about it so it can be found easily for those looking for an EO Tripod doc.

Currently it might need revised so just tell me if there's anything wrong/missing.

Thanks @cubing 4 ever @Cubing Forever for the help on TUL!
 
Status
Not open for further replies.
Back
Top