Difference between revisions of "LPELL"
m (→R LB) |
|||
(32 intermediate revisions by 7 users not shown) | |||
Line 1: | Line 1: | ||
− | {{ | + | {{Substep Infobox |
|name=LPELL | |name=LPELL | ||
|image=LPELLinfo.png | |image=LPELLinfo.png | ||
Line 5: | Line 5: | ||
|year=2011 | |year=2011 | ||
|anames= | |anames= | ||
− | |variants=[[ | + | |variants=[[ZBLS]], [[VHF2L]] |
|steps=2 or 1.5 | |steps=2 or 1.5 | ||
− | |algs= | + | |algs=96 |
− | |moves= | + | |moves=7.4 [[HTM]] |
|purpose=[[FMC]], [[Speedsolving]] | |purpose=[[FMC]], [[Speedsolving]] | ||
+ | |previous=[[F2L-1+pair+EO cube state]] | ||
+ | |next=[[LL:EO+EP cube state]] | ||
}} | }} | ||
'''Last pair and edges of the last layer''' is a [[method]] that solves the last [[F2L|F2L pair]] and all edges of the last layer. | '''Last pair and edges of the last layer''' is a [[method]] that solves the last [[F2L|F2L pair]] and all edges of the last layer. | ||
− | ===Intermediate | + | ===Intermediate=== |
− | This is | + | This is divided into two [[substep]]s: |
− | * '''LPEOLL''', orient all edges and pair up (any order). This is a intuitive step. Using algorithms is possible but you would need the same number as for [[ | + | * '''LPEOLL''', orient all edges and pair up (any order). This is a intuitive step. Using algorithms is possible but you would need the same number as for [[ZBLS]]. |
− | * '''LPEPLL''', place the last pair and permute all edges | + | * '''LPEPLL''', place the last pair and permute all edges. There are six cases and their mirrors. |
− | LPELL is | + | LPELL is maybe not so useful for [[speedsolving]], but for [[FMC]]. After this step is done you will have [[L4C]] left, 1:3 times it will be only [[L3C]] and 1:324 you will have a complete LL-skip. All L4C cases are easy to solve using one or two [[commutator]]s. In FMC, to save moves the commutators are preferably [[insert]]ed in the [[skeleton]] if such a point is found. |
− | ''Optimal algs for the second | + | ''Optimal algs for the second step are found lower at this page.'' |
− | ===Advanced | + | ===Advanced=== |
A second way to solve this step is to first pair up and then do the rest in one look. There are 48 + 48 mirror cases for the second half. An advanced method that, if you include L4C places the last pair and solve all of the last layer in two looks and 'only' 180 algs. Recognition for the edges is awful if you just look at it, but is not harder than COLL or something, if you use sticker colour recognition. | A second way to solve this step is to first pair up and then do the rest in one look. There are 48 + 48 mirror cases for the second half. An advanced method that, if you include L4C places the last pair and solve all of the last layer in two looks and 'only' 180 algs. Recognition for the edges is awful if you just look at it, but is not harder than COLL or something, if you use sticker colour recognition. | ||
''The cases are not listed on the internet, some day you may find them here...'' | ''The cases are not listed on the internet, some day you may find them here...'' | ||
− | ===Mad | + | ===Mad=== |
*All in one? | *All in one? | ||
− | *Forget it! There are thousands of cases. (six times | + | *Forget it! There are thousands of cases. (six times ZBLS) |
=LPEPLL Cases= | =LPEPLL Cases= | ||
{{Algnote}} | {{Algnote}} | ||
− | Some algs may need a leading | + | The names for the cases are where two of the edges will go, if it is a R side case, then these are first the edge sitting in UL and then the one in UB. For the L side cases these are UR and UB. The images assumes the UF edge is solved if the pair is above the slot, if it is some diffrent edge than UF, then just [[AUF]] it to solved position for recognition. Some algs may need a leading AUF if you are in the same position as the image, these are not explicity written here (the animations shows the correct position). |
− | The average number of moves is 6 [[HTM]] not including any leading or ending AUF. All cases are having the same probability (1:2 R or L and 1:6 within these groups). | + | |
− | The | + | The average number of moves is 6 [[HTM]] not including any leading or ending AUF. All cases are having the same probability (1:2 R or L and 1:6 within these groups). The algs here are all optimal, if there are more than one for a case, then the other(s) does some diffrent LL-corner case than the first one. |
− | |||
==R side pair== | ==R side pair== | ||
{|border="0" width="100%" valign="top" cellpadding="3" | {|border="0" width="100%" valign="top" cellpadding="3" | ||
Line 46: | Line 47: | ||
|methods=LPEPLL | |methods=LPEPLL | ||
|optimal=9 [[HTM]] | |optimal=9 [[HTM]] | ||
− | |text=All solved here, but just placing the pair will swap two edges, that are optimally solved by sneaking in a backside | + | |text=All solved here, but just placing the pair will swap two edges, that are optimally solved by sneaking in a backside Antisune.}} |
{{Alg|R U' R2 U2 R U R' U R}} | {{Alg|R U' R2 U2 R U R' U R}} | ||
+ | {{Alg|D R' U R' U' R' U R2 D'}} | ||
+ | {{Alg|F2 L' U' L U F2 R U' R'}} | ||
+ | |||
| width="50%" | | | width="50%" | | ||
Line 67: | Line 71: | ||
|methods=LPEPLL | |methods=LPEPLL | ||
|optimal=3 [[HTM]] | |optimal=3 [[HTM]] | ||
− | |text=The usual R U' R pair.}} | + | |text=The usual R U' R' pair.}} |
− | {{Alg|R U' R}} | + | {{Alg|R U' R'}} |
| width="50%" | | | width="50%" | | ||
Line 79: | Line 83: | ||
|text=Unexpected conjugate to solve.}} | |text=Unexpected conjugate to solve.}} | ||
{{Alg|R2 D L' B2 L D' R2 }} | {{Alg|R2 D L' B2 L D' R2 }} | ||
+ | {{Alg|R' U2 R U R' U R2 U2 R' U }} | ||
|-valign="top" | |-valign="top" | ||
| width="50%" | | | width="50%" | | ||
Line 90: | Line 95: | ||
|text=Sune style solution.}} | |text=Sune style solution.}} | ||
{{Alg|R U R' U' R U' R'}} | {{Alg|R U R' U' R U' R'}} | ||
+ | {{Alg|R U' R' U R U2 R' }} | ||
| width="50%" | | | width="50%" | | ||
Line 100: | Line 106: | ||
|text=A 3-cycle commutator.}} | |text=A 3-cycle commutator.}} | ||
{{Alg|L' U2 R U R' U2 L}} | {{Alg|L' U2 R U R' U2 L}} | ||
+ | {{Alg|R' U2 R U R U' R2 U2 R U}} | ||
|} | |} | ||
Line 114: | Line 121: | ||
|text=Mirror of R LB.}} | |text=Mirror of R LB.}} | ||
{{Alg|L' U L2 U2 L' U' L U' L'}} | {{Alg|L' U L2 U2 L' U' L U' L'}} | ||
+ | {{Alg|D' L U' L U L U' L2 D}} | ||
+ | {{Alg|F2 R U R' U' F2 L' U L}} | ||
+ | |||
| width="50%" | | | width="50%" | | ||
Line 168: | Line 178: | ||
|} | |} | ||
− | + | ||
− | [[Category:3x3x3 | + | [[Category:3x3x3 methods]] |
− | [[Category: | + | [[Category:Fewest Moves Methods]] |
− | [[Category: | + | [[Category:3x3x3 last layer methods]] |
− | [[Category: | + | |
+ | [[Category:Acronyms]] | ||
[[Category:Algorithms]] | [[Category:Algorithms]] | ||
− | [[Category: | + | [[Category:3x3x3 last layer substeps]] |
__NOTOC__ | __NOTOC__ |
Revision as of 16:42, 29 August 2017
|
Last pair and edges of the last layer is a method that solves the last F2L pair and all edges of the last layer.
Intermediate
This is divided into two substeps:
- LPEOLL, orient all edges and pair up (any order). This is a intuitive step. Using algorithms is possible but you would need the same number as for ZBLS.
- LPEPLL, place the last pair and permute all edges. There are six cases and their mirrors.
LPELL is maybe not so useful for speedsolving, but for FMC. After this step is done you will have L4C left, 1:3 times it will be only L3C and 1:324 you will have a complete LL-skip. All L4C cases are easy to solve using one or two commutators. In FMC, to save moves the commutators are preferably inserted in the skeleton if such a point is found.
Optimal algs for the second step are found lower at this page.
Advanced
A second way to solve this step is to first pair up and then do the rest in one look. There are 48 + 48 mirror cases for the second half. An advanced method that, if you include L4C places the last pair and solve all of the last layer in two looks and 'only' 180 algs. Recognition for the edges is awful if you just look at it, but is not harder than COLL or something, if you use sticker colour recognition.
The cases are not listed on the internet, some day you may find them here...
Mad
- All in one?
- Forget it! There are thousands of cases. (six times ZBLS)
LPEPLL Cases
Note that all of these algorithms are written in the Western notation, where a lowercase letter means a double-layer turn and rotations are denoted by x, y, and z. (how to add algorithms) Click on an algorithm (not the camera icon) to watch an animation of it. |
The names for the cases are where two of the edges will go, if it is a R side case, then these are first the edge sitting in UL and then the one in UB. For the L side cases these are UR and UB. The images assumes the UF edge is solved if the pair is above the slot, if it is some diffrent edge than UF, then just AUF it to solved position for recognition. Some algs may need a leading AUF if you are in the same position as the image, these are not explicity written here (the animations shows the correct position).
The average number of moves is 6 HTM not including any leading or ending AUF. All cases are having the same probability (1:2 R or L and 1:6 within these groups). The algs here are all optimal, if there are more than one for a case, then the other(s) does some diffrent LL-corner case than the first one.
R side pair
R LB
|
R RB
| ||||||||||||||||||||
R LR
|
R RL
| ||||||||||||||||||||
R BL
|
R BR
|
L side pair
L RB
|
L LB
| ||||||||||||||||||||
L RL
|
L LR
| ||||||||||||||||||||
L BR
|
L BL
|