• Welcome to the Speedsolving.com, home of the web's largest puzzle community!
    You are currently viewing our forum as a guest which gives you limited access to join discussions and access our other features.

    Registration is fast, simple and absolutely free so please, join our community of 35,000+ people from around the world today!

    If you are already a member, simply login to hide this message and begin participating in the community!

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

DNF_Cuber

Member
Joined
Nov 14, 2020
Messages
1,823
Location
Beyond the grave.....
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

Member
Joined
Mar 22, 2021
Messages
26
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

Member
Joined
Oct 13, 2020
Messages
30
Location
India
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.
 
Joined
Aug 30, 2020
Messages
912
Location
On a long train journey, Smashin' PBs one a stop
YouTube
Visit Channel
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.
 

ObscureCuber

Member
Joined
Feb 15, 2020
Messages
680
Location
Somewhere i guesss
YouTube
Visit Channel
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?
 

Athefre

Member
Joined
Jul 25, 2006
Messages
1,069
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

Member
Joined
Oct 13, 2020
Messages
30
Location
India
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.
 

Attachments

Athefre

Member
Joined
Jul 25, 2006
Messages
1,069
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

Member
Joined
Oct 13, 2020
Messages
30
Location
India
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
 

xsac

Member
Joined
Dec 9, 2020
Messages
6
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
Seems cool, I'll give it a try
 
Top