Thermex
Member
Hello everyone,
This is a thread for a method I recently proposed on the new method/substep thread called "BOPE" or Higgs. BOPE is the first method ever to have a potential movecount of 40 or less moves, making it one of the most efficient methods ever proposed. Despite being so few moves, BOPE doesn't have a rediculous amount of algorithms, totalling nearly a fourth of the algs of other top methods such as LMCF and ZBLL (about 160 algorithms in its current state). The name BOPE comes from the initials of the steps of the method, which are:
1. Blocks: Solve two 1×2×2 blocks next to each other on the left side of the cube, in other words a 2×2×3 block minus the DL edge (~10 moves on average)
2. Orientation: Orient the six remaining corners on the cube, this step is known as "OSC" (~50 algorithms that each average 4-5 moves)
3. Permutation: Permute the six remaining corners, this step is known as "PSC" (~50 algorithms that are about 8 moves on average)
4. Edges: There are several approaches to the last 8 edges, most being around 19 moves. The most simple version of this step is:
a.) Solve either the FL and FR edges or the UL and UR edges
b.) Solve the last six edges with Roux LSE
The more efficient algorithmic approach used in eric fattah's LMCF method can also be used here and goes as follows:
a.) In one algorithm, solve any two edges of the right and left layers
b.) Orient all 6 remaining edges while solving the rest of the edges that go in the right or left layer
c.) Permute the midges
To learn more about this approach, check out efattah's LMCF pdf here: (ttps://drive.google.com/open?id=0B2QnZ3uD6I8kNkpHSURSbzluc2s)
With these estimates, BOPE would average in the ballpark of around 40 moves. Algorithms are currently being made for the OSC and PSC steps, so this method is not quite ready to be published. There is also potentially a more efficient way to solve the last 8 edges than solving ULUR and then doing LSE, so any ideas for that are appreciated. The method is currently being worked on by me, @Spencer131, @Neuro, @crafto22 and should be completed soon. Any questions, ideas or constructive criticisms are encouraged.
This is a thread for a method I recently proposed on the new method/substep thread called "BOPE" or Higgs. BOPE is the first method ever to have a potential movecount of 40 or less moves, making it one of the most efficient methods ever proposed. Despite being so few moves, BOPE doesn't have a rediculous amount of algorithms, totalling nearly a fourth of the algs of other top methods such as LMCF and ZBLL (about 160 algorithms in its current state). The name BOPE comes from the initials of the steps of the method, which are:
1. Blocks: Solve two 1×2×2 blocks next to each other on the left side of the cube, in other words a 2×2×3 block minus the DL edge (~10 moves on average)
2. Orientation: Orient the six remaining corners on the cube, this step is known as "OSC" (~50 algorithms that each average 4-5 moves)
3. Permutation: Permute the six remaining corners, this step is known as "PSC" (~50 algorithms that are about 8 moves on average)
4. Edges: There are several approaches to the last 8 edges, most being around 19 moves. The most simple version of this step is:
a.) Solve either the FL and FR edges or the UL and UR edges
b.) Solve the last six edges with Roux LSE
The more efficient algorithmic approach used in eric fattah's LMCF method can also be used here and goes as follows:
a.) In one algorithm, solve any two edges of the right and left layers
b.) Orient all 6 remaining edges while solving the rest of the edges that go in the right or left layer
c.) Permute the midges
To learn more about this approach, check out efattah's LMCF pdf here: (ttps://drive.google.com/open?id=0B2QnZ3uD6I8kNkpHSURSbzluc2s)
With these estimates, BOPE would average in the ballpark of around 40 moves. Algorithms are currently being made for the OSC and PSC steps, so this method is not quite ready to be published. There is also potentially a more efficient way to solve the last 8 edges than solving ULUR and then doing LSE, so any ideas for that are appreciated. The method is currently being worked on by me, @Spencer131, @Neuro, @crafto22 and should be completed soon. Any questions, ideas or constructive criticisms are encouraged.
Last edited: