As far as I know, this already exists. It's called Zipper-b and actually has a couple users.A new 2 look LSLL Method:
(Considering that the LS corner is solved)
step 1: CLL(42 algs, half of which can be transferred from/to 2x2)
step 2: L5E cycling FR(technically 162 but most of them can be solved by using 1 or 2 3 style comms or 1 5 style comm and the rest of them are either flips or 2e2e so it comes down to 40-50)
Total algcount: 82-92(if you use 2 3 style comms for the 5 cycles) to 208.
Low algcount for 2 look LSLL
Corner needs to be solved in LS for this to work.
L5C>L5E (basically M-CELL from the the side)
Is this already proposed? If so pls update.
won't it be better to pair edges using a free slot instead of commutators? you can use the fr slot to pair edges, and then simply put it back as paired edges aren't disturbed during edge pairing.
When using Petrus or ZZ you already have all the edges oriented (EO), in the case of Petrus you must finish the F2L using only 2 gen movements, you can start arming and inserting for example the BR pair, which leaves you in a situation of F2L -1, at this time before inserting the last pair, you must get two opposite edges to be in line and parallel to the last pair, this causes a reduction of cases of LPEPLL (it is a subset of LPELL), reducing the 6 cases of LPEPLL to only two. You only have to learn two algorithms, to insert the last pair and that all the edges are permuted.Traducción: ‘Hello friends of Speedolving !!!
I have been solving the 3 × 3 × 3 with Petrus, and I think I found a variant of reductions in this method (it can also be applied to ZZ or Heise).
It consists of performing the same steps from Petrus to EO, from here the BR pair must be inserted, before inserting the last F2L pair, we must place two opposite edges in line (for example green / blue), making this movement, I reduce the LPEPLL algorithms to 2 cases, one of them with three well-permuted edges and the other with two well-permuted edges, for these cases there are two algorithms that serve to insert the F2L and permute all the edges. Then I use OLC algorithms to keep the edges well permuted and finally I have PLL reduced to 4 cases (Aa / b, E, H).
I think it is the 2LLL variant with less algorithms (2 LPEPLL cases, 7 OLC algorithms and 4 PLL algorithms = 13 algorithms)
I do not know if anyone has already thought about this variant, I did not see it anywhere.
If so, I would like to have suggestions for the name of this variant, for now I say Petrus - EW.
Let me know in your comments if this variant already exists, I think not.
PS: Sorry for my English’
Not quite sure what you mean, been a long time since I’ve been doing cubing lingo. Hopefully someone else can help out.
No estoy muy seguro de lo que quieres decir, ha pasado mucho tiempo desde la última vez que he estado usando jerga de cubos. Ojalá alguien más pueda ayudar.
Don’t think anyone else has done this before, but then again Petrus is a rare method. It’s basically for last slot.When using Petrus or ZZ you already have all the edges oriented (EO), in the case of Petrus you must finish the F2L using only 2 gen movements, you can start arming and inserting for example the BR pair, which leaves you in a situation of F2L -1, at this time before inserting the last pair, you must get two opposite edges to be in line and parallel to the last pair, this causes a reduction of cases of LPEPLL (it is a subset of LPELL), reducing the 6 cases of LPEPLL to only two. You only have to learn two algorithms, to insert the last pair and that all the edges are permuted.
What follows is to make an OLC algorithm that is a subset of OLL that maintains the permutation of the edges, there are 7 algorithms. Finally, it only remains to recognize the cases of PLL reduced to 4 (Aa, Ab, E, H).
Es cierto que Petrus es un método poco utilizado, pero esta variante de reducción no solo se limita al método Petrus, también se puede utilizar en ZZ. Al igual que Phasing, que es de ZZ, se puede usar en Petrus.No creo que nadie más haya hecho esto antes, pero Petrus es un método poco común. Básicamente es para el último espacio.
|Thread starter||Similar threads||Forum||Replies||Date|
|I Used DGCubes' Method To Skip OLL Every Solve...||Puzzle Video Gallery||0|
|JSS Method||General Speedcubing Discussion||1|
|Brainstorming for methods/substeps (for speedsolving)||General Speedcubing Discussion||10|
|Calculating Method/Substep Efficiency||Puzzle Theory||27|
|Method Substeps and Subgroups||Puzzle Theory||4|