The New Method / Substep / Concept Idea Thread

[Petrus_EW]

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.

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).

 

[PetrusQuber]

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).

Don’t think anyone else has done this before, but then again Petrus is a rare method. It’s basically for last slot.

 

[Petrus_EW]

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.

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.
Es una variante de reducción, creo que es el método 2LLL con menos algoritmos. Alguna sugerencia para su nombre.
Lo descubrí usando Petrus.

 

[AlgoCuber]

8355 Method for Speedsolving?

If you don't know what the 8355 method is, I recommend you watch this video:

My idea to make this suitable for speedsolving is this:

1. Do the cross as normal
2. Solve 3 F2L pairs, there are different ways to do this
   • Using keyhole slotting/psuedoslotting, as shown in the video
   • Using CFOP F2L, but since there is always one slot left open the move count is greatly reduced
3. Solve the remaining 5 edges, there are different ways to do this
   • Using one algorithm
   • On the first 3 yellow edges, make sure 2 are "correct" and 1 is not. Then, do the rest using 3 moves
4. Solve the remaining 5 corners, there are different ways to do this
   • Using one algorithm
   • 2-look it (My idea is to use commutators, may require some intuition)

This should be a great speedcubing method because

1. First 3 pairs do not use a lot of moves
2. The rest can be solved using algorithms

But a downside is that there will probably be a lot of algorithms to learn. The algorithms shouldn't be too different from CFOP, although they may require some changes. All points I listed above may not be optimized and the move count probably can be made smaller. I don't really know how to make algorithms though, so I guess you guys can help develop this method and make algorithms for it! Reply with any suggestions for the method you would like

 

[Petrus_EW]

Hello Speedsolving community!​

I want to tell you about this 2-look reduction variant, which I think is the unofficial variant with the lowest algorithm count in Speedsolving. Perfect for methods like Petrus or ZZ. I will explain it to you.​

​

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 generation movements, you can start to assemble and insert for example the BR pair, which leaves you in a situation of F2L -1, at this moment 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 6 cases of LPEPLL to only 2. It is only necessary to learn 2 algorithms, insert the last pair and that all edges are permuted.​

What follows is to make an OLC algorithm (it is a subset of OLL) that maintains the permutation of the edges, there are 7 algorithms that do this. Finally, it only remains to recognize the reduced PLL cases that are 4 (Aa, Ab, E, H).​

Please comment your thoughts on this reduction variant.​

 

[DNF_Cuber]

Hello Speedsolving community!​

I want to tell you about this 2-look reduction variant, which I think is the unofficial variant with the lowest algorithm count in Speedsolving. Perfect for methods like Petrus or ZZ. I will explain it to you.​

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 generation movements, you can start to assemble and insert for example the BR pair, which leaves you in a situation of F2L -1, at this moment 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 6 cases of LPEPLL to only 2. It is only necessary to learn 2 algorithms, insert the last pair and that all edges are permuted.​

What follows is to make an OLC algorithm (it is a subset of OLL) that maintains the permutation of the edges, there are 7 algorithms that do this. Finally, it only remains to recognize the reduced PLL cases that are 4 (Aa, Ab, E, H).​

Please comment your thoughts on this reduction variant.​

that gets you worse cases for PLL, and I would count lpepll as a look in itself

 

[Petrus_EW]

that gets you worse cases for PLL, and I would count lpepll as a look in itself

So is it a 3-look variant?

 

[Deleted member 55877]

This variant isn't worth using. Just work your way up to OCLL/PLL by starting with OCLL/CP/EPLL

 

[Petrus_EW]

This variant isn't worth using. Just work your way up to OCLL/PLL by starting with OCLL/CP/EPLL

Thank you very much for your suggestion, I know those variants both, OCLL / PLL and OCLL / CP / EPLL. I was just looking for a different variant.​

 

[Petrus_EW]

This variant isn't worth using. Just work your way up to OCLL/PLL by starting with OCLL/CP/EPLL

Thank you very much for your suggestion, I know those variants both, OCLL / PLL and OCLL / CP / EPLL. I was just looking for a different variant.

 

[Rouxster]

EG 1 ON 3 by 3
on the wiki, it says that EG 1 is particularly useful for LMCF and and some other method but I think it could be REALLY useful for roux.
keeping the front two pairs swapped can save many moves during blockbuilding, especially if there are many free pairs. Then we can solve the pairs and top layer corners using an EG 1. With usage of wide r moves most of the EG 1s from Jperm.net don't mess up the pairs.
The only problem with this is that predicting EO after EG 1 is quite hard.
PS- If someone has thought about this before, Can you provide me good algs for these cases? the information about these varients is scattered all over the forums so I posted this here just to be sure.

 

[Cubing Forever]

EG 1 ON 3 by 3
on the wiki, it says that EG 1 is particularly useful for LMCF and and some other method but I think it could be REALLY useful for roux.
keeping the front two pairs swapped can save many moves during blockbuilding, especially if there are many free pairs. Then we can solve the pairs and top layer corners using an EG 1. With usage of wide r moves most of the EG 1s from Jperm.net don't mess up the pairs.
The only problem with this is that predicting EO after EG 1 is quite hard.
PS- If someone has thought about this before, Can you provide me good algs for these cases? the information about these varients is scattered all over the forums so I posted this here just to be sure.

There's ACMLL. Btw 2x2 EG1 algs can be used with wide moves.

 

[PetraPine]

EG 1 ON 3 by 3
on the wiki, it says that EG 1 is particularly useful for LMCF and and some other method but I think it could be REALLY useful for roux.
keeping the front two pairs swapped can save many moves during blockbuilding, especially if there are many free pairs. Then we can solve the pairs and top layer corners using an EG 1. With usage of wide r moves most of the EG 1s from Jperm.net don't mess up the pairs.
The only problem with this is that predicting EO after EG 1 is quite hard.
PS- If someone has thought about this before, Can you provide me good algs for these cases? the information about these varients is scattered all over the forums so I posted this here just to be sure.

this is pretty close to waterroux, but seemingly just a more advanced version of it?

 

[Rouxster]

this is pretty close to waterroux, but seemingly just a more advanced version of it?

Yeah it is sort of like that, but it is an easier version cause the algorithm count is less and recognition is exactly like cmll.

 

[Athefre]

Yeah, it would be ACMLL. I haven't gotten to generating that set yet though. There are so many possibilities. If you're interested in generating this set and similar ones, you can do that. I can then add that to the ACMLL document and give you credit for finding the algs.

 

[Rouxster]

Yeah, it would be ACMLL. I haven't gotten to generating that set yet though. There are so many possibilities. If you're interested in generating this set and similar ones, you can do that. I can then add that to the ACMLL document and give you credit for finding the algs.

That would be nice!
Here are the algs for the most basic subset- where the front two "f2l" pairs are in swapped positions.

 

[Athefre]

That would be nice!
Here are the algs for the most basic subset- where the front two "f2l" pairs are in swapped positions.

Wow. A lot of those algs are amazing. Some others will need some development over time. I'll get these added to the ACMLL document, give you credit, and let you know. Thank you! This is awesome.

How do you want to be credited? A real name or username?

 

[Rouxster]

Wow. A lot of those algs are amazing. Some others will need some development over time. I'll get these added to the ACMLL document, give you credit, and let you know. Thank you! This is awesome.

How do you want to be credited? A real name or username?

Real name -it's Aditya Pathak

 

[Cubing Forever]

That would be nice!
Here are the algs for the most basic subset- where the front two "f2l" pairs are in swapped positions.

Better alg for Pi left bar is R U' r2 F R2 U' R'

 

[Rouxster]

Better alg for Pi left bar is R U' r2 F R2 U' R'

I think that's the one I've written.