#### Petrus_EW

##### Member

- Joined
- Mar 22, 2021

- Messages
- 26

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.