The New Method / Substep / Concept Idea Thread

[ProStar]

Since the phased edges are in the same orientation, the remaining two edges are in the same orientation as well. Thus there are 4 eo possibilities: f/b unoriented, l/r unoriented, all unoriented, and none unoriented. Thus the total number of algorithms will be exactly 4 times ZZLL, which is 169 algs. Thus this method has 4 * 169 + 6 = 682 algs, compared to ZB's 799. The f2l pair and phasing take less than 1 look, as they are simple and easy to plan through lookahead. Thus in reality, this method takes ~2.5 looks or less, if you understand what I mean. On the other hand, each of the steps of ZB have pretty complicated recognition, and will take 2 looks. Thus I think the total recognition time for my method and the ZB method will not be too different.

ZB doesn't have complicated recognition. It's probably easier than your method, although I can't say for sure.

 

[brododragon]

when did i say that

Yes.

Okay, I usually wouldn't do this, but my post got drowned out by Muke and his I don't even know what arguments, so I'm gonna copy it here.

New method:
1. Wheels 2 1x2x2 at DBR and DBL.
2. EOEdges EO, then edges.
3. EP Permute UL, UR, FL, FR.
4. F3C First 3 Corners - solve DFR, DFL, UFL - 162 algs.
5. L3C Last 3 Corners - 24 algs, but they are included in F3C.

Spoiler: More

162 algs. Solving CO parity, then F3C + L3C will drop down the number to 54. EOEdges looks harder than it is. First, EO, then you just have to make sure your M-Slice solution solves UL, UR, FL, and FR. there are only 3 possibly permutations for them. Also, maybe instead of making sure crosses are solved (UL, UR, FL, FR), you could leave them unsolved and solve parity with?

 

[ProStar]

Yes.

Okay, I usually wouldn't do this, but my post got drowned out by Muke and his I don't even know what arguments, so I'm gonna copy it here.

New method:
1. Wheels 2 1x2x2 at DBR and DBL.
2. EOEdges EO, then edges.
3. EP Permute UL, UR, FL, FR.
4. F3C First 3 Corners - solve DFR, DFL, UFL - 162 algs.
5. L3C Last 3 Corners - 24 algs, but they are included in F3C.

Spoiler: More

162 algs. Solving CO parity, then F3C + L3C will drop down the number to 54. EOEdges looks harder than it is. First, EO, then you just have to make sure your M-Slice solution solves UL, UR, FL, and FR. there are only 3 possibly permutations for them. Also, maybe instead of making sure crosses are solved (UL, UR, FL, FR), you could leave them unsolved and solve parity with?

L6C can be solved with comms

 

[brododragon]

L6C can be solved with comms

The aim is speedsolving.

 

[mukerflap]

cfop LL method:
EOCP
2GLL
not my idea

 

[Silky]

So, this is a proposal for a new variant/hybrid of Roux. It is a mix of the SOAP method for 2x2 (https://www.cubestuff.cf/?soap) and Roux.

--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

Overview/steps:

Step 1: FB + E-slice

1(a) = > This is the same step as in Roux. Blockbuild a 1x2x3 block on the L face.
1(b) = > Finish the E-slice, placing FR and BR edges in their respective spots.

Step 2: SOAP

2(a) = > Pair two D face corners (white corners) and place them in the FRU and BRU or FRD and BRD positions. These corners do no need to be oriented or permuted correctly relative to the FR and BR edges.
2(b) = > Perform SOAP style corners. First orient all 6 remaining corners and then permute them. This step would require that first block and E-slice edges are preserved.

Step 3: EO + FD edge

3(a) = > Perform EO regularly as in Roux.
3(b) = > Place FD edge finishing the second block.

Step 4: L6EP
= > Perform Last 6 edges as in normal Roux.

--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

Pros:

(1) = > Step 1 can be planned out in inspection. This would most likely be easier than planning first block and 1x2x2 square in normal Roux.
(2) = > The orientation step of the SOAP Method is mostly 2-Gen which would make them finger-trickable. If the white corners are placed in the FRD and BRD positions (the separation step in SOAP) the orientation step could be done without looking at the D-face corners (unless you skip the separation step all together).
(3) = > The orientation algorithms can be done such that no corners on the D-face are dis-permuted meaning that if you predict/track how U-layer corners are permuted (during the orientation step) this step can be done in one look instead of two.
(4) = > Based on how the second block is solved it may be easier to preform NMLL (yellow corners/FD edge instead of white)
(4) = > The EO and FD placement can be done simultaneously.
(5) = > After performing EO and FD placement you can perform a Rw2 and see all M-slice edges leaving no blindspots.
(6) = > Because you solve 6 corners simultaneously as well as performing EO and FD placement at the same time, this method should be at least as, if not more, efficient than Roux.
(7) = > There aren't that many algs to learn, 56 I think.
(8) = > I'm naming it SOUP (or SOUXP; SOAP+Roux).

Cons:

(1) = > I haven't generated any algs (as I don't really know how to; although I assume you should be able to modify the existing ones with wide moves). Given that you need to preserve the first block and E-slice they may be less efficient (although hopefully the 2-gen will make up for that).
(2) = > SOAP as a 2x2 method hasn't proven to be viable (yet) and incorporating it may not be all that useful/fast.
(3) = > SOAP corners may have difficult look-ahead and may need to be two looked.
(4) = > Step (2) and Step (3) may prove to be more difficult than they're worth (Ya'll can decide that for yourselves).

--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

Being a Roux solver myself, I'm actually pretty excited for this method and am hopeful that it could be viable.

If anyone is interested in this method and wants to help generate algs that would be amazing ! Comments/thoughts and critiques are alway welcome.

Below is my original proposal for a SOAP-PCSM variant (my inspiration for SOUP), if anyone is interested.

So I've been thinking about PCMS lately and believe I've come up with an interesting variant.

Overview:

Step 1: Place 2 corner edge pairs on the left face and finish the E-slice.
Step 2: SOAP method for corners (https://www.cubestuff.cf/?soap).
2a: Separate corners to their respected faces.
2b: Orient and permute last 6 corners while preserving the E-slice.
Step 3: Permute centers while placing LD and RD edges.
Step 4: Orient remain 6 edges while placing DB edge.
Step 5: Permute last 5 edges (L5EP).

Pros:

(1) Inspection: It seems realistic to plan out all of step 1 in inspection and possibly step 2a.
(2) Corners: Being that the corners are solved using a modified 2x2 method (SOAP) it should be more efficient. It also should maintain the freedom of the pairs of PCMS.
(3) Algs: There wouldn't be too many algs (SOAP has 58, L5EP has 16) and the SOAP algs are mostly 2-gen.
(4) Because this method borrows from the SOAP method it should be clean af. #CoronaCubing

Cons:

(1) SOAP isn't really a proven 2x2 method so it just might not be that fast.
(2) The potential is very reliant on what you can plan in inspection.
(3) It just may not be worth it to preform corners compared to how PCMS does.
(4) Corners may take 2 looks instead of 1 (which will probably make it not that relevant).

If this has already been preposed, sorry. If not then let me know what you guys think.

 

[Skewbed]

Since the phased edges are in the same orientation, the remaining two edges are in the same orientation as well. Thus there are 4 eo possibilities: f/b unoriented, l/r unoriented, all unoriented, and none unoriented. Thus the total number of algorithms will be exactly 4 times ZZLL, which is 169 algs. Thus this method has 4 * 169 + 6 = 682 algs, compared to ZB's 799. The f2l pair and phasing take less than 1 look, as they are simple and easy to plan through lookahead. Thus in reality, this method takes ~2.5 looks or less, if you understand what I mean. On the other hand, each of the steps of ZB have pretty complicated recognition, and will take 2 looks. Thus I think the total recognition time for my method and the ZB method will not be too different.

I think you left out the 4 adjacent mis-oriented cases. F and R, F and L, B and R, B and L. I do not get why phased edges would be in the same orientation, is that part of the phasing process in your method?

 

[mukerflap]

So, this is a proposal for a new variant/hybrid of Roux. It is a mix of the SOAP method for 2x2 (https://www.cubestuff.cf/?soap) and Roux.

--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

Overview/steps:

Step 1: FB + E-slice

1(a) = > This is the same step as in Roux. Blockbuild a 1x2x3 block on the F face.
1(b) = > Finish the E-slice, placing FR and BR edges in their respective spots.

Step 2: SOAP

2(a) = > Pair two D face corners (white corners) and place them in the FRU and BRU or FRD and BRD positions. These corners do no need to be oriented or permuted correctly relative to the FR and BR edges.
2(b) = > Perform SOAP style corners. First orient all 6 remaining corners and then permute them. This step would require that first block and E-slice edges are preserved.

Step 3: EO + FD edge

3(a) = > Perform EO regularly as in Roux.
3(b) = > Place FD edge finishing the second block.

Step 4: L6EP
= > Perform Last 6 edges as in normal Roux.

--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

Pros:

(1) = > Step 1 can be planned out in inspection. This would most likely be easier than planning first block and 1x2x2 square in normal Roux.
(2) = > The orientation step of the SOAP Method is mostly 2-Gen which would make them finger-trickable. If the white corners are placed in the FRD and BRD positions (the separation step in SOAP) the orientation step could be done without looking at the D-face corners (unless you skip the separation step all together).
(3) = > The orientation algorithms can be done such that no corners on the D-face are dis-permuted meaning that if you predict/track how U-layer corners are permuted (during the orientation step) this step can be done in one look instead of two.
(4) = > Based on how the second block is solved it may be easier to preform NMLL (yellow corners/FD edge instead of white)
(4) = > The EO and FD placement can be done simultaneously.
(5) = > After performing EO and FD placement you can perform a Rw2 and see all M-slice edges leaving no blindspots.
(6) = > Because you solve 6 corners simultaneously as well as performing EO and FD placement at the same time, this method should be at least as, if not more, efficient than Roux.
(7) = > There aren't that many algs to learn, 56 I think.
(8) = > I'm naming it SOUP (or SOUXP; SOAP+Roux).

Cons:

(1) = > I haven't generated any algs (as I don't really know how to; although I assume you should be able to modify the existing ones with wide moves). Given that you need to preserve the first block and E-slice they may be less efficient (although hopefully the 2-gen will make up for that).
(2) = > SOAP as a 2x2 method hasn't proven to be viable (yet) and incorporating it may not be all that useful/fast.
(3) = > SOAP corners may have difficult look-ahead and may need to be two looked.
(4) = > Step (2) and Step (3) may prove to be more difficult than they're worth (Ya'll can decide that for yourselves).

--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

Being a Roux solver myself, I'm actually pretty excited for this method and am hopeful that it could be viable.

If anyone is interested in this method and wants to help generate algs that would be amazing ! Comments/thoughts and critiques are alway welcome.

Below is my original proposal for a SOAP-PCSM variant (my inspiration for SOUP), if anyone is interested.

SOAP corner orientation and permutation algs are probably trash and the recognition would be hard for permutation. EO FD is a weird step and would require you do M and S move switching. Why not just solve FD edge as a part of the e slice?
Also, please prove how efficient this method is on this scramble. You can use 1 look soap algs if you want
R2 D L2 D L2 B2 U B2 R2 U B L' D' F2 R' F L2 D' U F

classic roux solution:
z' y' F' D U M' U' r' B 7/7
r U R U M' U' R U' r U R' 11/18
U' L' U R U' L U R 8/26
U' M U' M' U M U M' U2 M' U2 M 12/38
38stm

 

[whaffle]

I think you left out the 4 adjacent mis-oriented cases. F and R, F and L, B and R, B and L. I do not get why phased edges would be in the same orientation, is that part of the phasing process in your method?

Yes. After some thought though, I think this probably wouldn't be as good as ZB.

 

[I'm A Cuber]

cfop LL method:
EOCP
2GLL
not my idea

The only cfop ll method is oll -> pll, as started by the name of the method

 

[PetraPine]

The only cfop ll method is oll -> pll, as started by the name of the method

bruh

 

[brododragon]

SOAP corner orientation and permutation algs are probably trash and the recognition would be hard for permutation. EO FD is a weird step and would require you do M and S move switching. Why not just solve FD edge as a part of the e slice?
Also, please prove how efficient this method is on this scramble. You can use 1 look soap algs if you want
R2 D L2 D L2 B2 U B2 R2 U B L' D' F2 R' F L2 D' U F

classic roux solution:
z' y' F' D U M' U' r' B 7/7
r U R U M' U' R U' r U R' 11/18
U' L' U R U' L U R 8/26
U' M U' M' U M U M' U2 M' U2 M 12/38
38stm

Nice, Muke being a hateful pessimist with no actually evidence backing it up.

 

[AlphaCuber is awesome]

Nice, Muke being a hateful pessimist with no actually evidence backing it up.

All of his points were valid and there isn’t really any evidence he needs in this case.

 

[ThisNameIsAlreadyTaken]

This is a LEOR for big cubes variant:
1. Left block + opposite center
2. D and B centers + DB dedge
3. Last 2 centers
4. Dedge pairing while solving EO
5. Complete EOLine
6. Right block
7. LL

 

[brododragon]

Nice, Muke being a hateful pessimist with no actually evidence backing it up.

Eh, half his arguments are "x is probably trash" using probably as a substitute for evidence.

 

[PapaSmurf]

This is a LEOR for big cubes variant:
1. Left block + opposite center
2. D and B centers + DB dedge
3. Last 2 centers
4. Dedge pairing while solving EO
5. Complete EOLine
6. Right block
7. LL

You're probably better off doing meyer until 3x3 stage (which is what I do).

 

[ThisNameIsAlreadyTaken]

You're probably better off doing meyer until 3x3 stage (which is what I do).

So, something like steps 1-3 of Meyer, then pairing + EO, right block, LL, would be better?

 

[mukerflap]

So, something like steps 1-3 of Meyer, then pairing + EO, right block, LL, would be better?

Meyer until 3x3 stage then continue with leor

 

[Cubingcubecuber]

I proposed an unrefined version of this on the HK discord a a week or two ago, but I should post this here: HKY:
during HKF2L, the DF edge is put in the right spot, though not necessarily oriented. Then there is one logical path: COLL. OCLL leaves you with two many cases, but COLL will leave you with a small subset of L5E. If I am right, it should be ~58 algs+COLL

I will call the subset L5EDF unless anyone has a better name

 

[Alex Shih]

I've recently thought of a possible new big cube method that uses Roux but doesn't quite follow the standard redux layout like Meyer (if this has been proposed before, I apologize):

1. First 2 centers
2. Build Roux blocks on F2C
3. CMLL
4. Pair up and solve the ULUR edges (a little unsure about this step)
5. Solve the rest of the cube using slice moves and U2 (I'll definitely end up breaking this into substeps, but I'm not quite sure how yet)

With modern hardware, I think this could definitely be fast for 4x4/5x5 if the recognition for the substeps in step 5 is good and the step 5 substeps can be solved (mostly) intuitively. I also found some info for a "Stadler Method" for 4x4 that's pretty close to my method but follows redux more closely (english is on the right column): https://www.speedcubing.ch/lösungsanleitungen/4x4-stadler-methode/.

Edit: After some more thought, I've realized step 4 + solving the rest of the cube is probably slower than solving L4C using slice moves, doing a bunch of edge cycles to finish edge pairing, and then doing 3x3 LSE. I've already made MlrU algs that cycle edges while preserving ULUR, so the only thing I really need now are algs that cycle edges in the M-slice which don't necessarily preserve the UL/UR edges (since preserving ULUR makes the edge cycles really move-inefficient).