Mats Valk

2012-05-12T11:01:28Z

Mvcuber12:

{{Infobox
|NAME=Mats Valk
|IMAGE=Mats Valk.jpg
|IMAGEYEAR=!
|ALIASES=
|COUNTRY=The Netherlands
|BIRTHDATE=May 4, 1996
|AGE=16
|JOBS=Student
|YEARSACTIVE=2007-current
|ID=2007VALK01
|FAMOUSFOR=3x3, 4x4 WR
}}

'''Mats Valk''' is a [[Netherlands|Dutch]] speedcuber. He currently holds the world record for the 4x4 single and average.

== Notable Videos ==
* [http://www.speedsolving.com/forum/showthread.php?34172-Mats-Valk-official-World-Record-4x4-single-30.02 Mats Valk official World Record 4x4 single : 30.02]
* [http://www.speedsolving.com/forum/showthread.php?36416-video-Mats-Valk-Single-WR-26.77-average Mats Valk Single WR 26.77 + average]

== See Also ==
* [[List of notable color blind cubers]]
* [[List of World Records/4x4x4]]

== External Links ==
* [http://www.youtube.com/user/mvcuber12 Mats Valk's YouTube channel]
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?33225-Mats-Valk-just-got-a-6.84-single! Mats Valk just got a 6.84 single!]
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?33337-Mats-Valk-s-6.41-European-Record-at-2011-Dutch-Open-(with-close-up-amp-slow-mo) Mats Valk's 6.41 European Record at 2011 Dutch Open (with close up & slow mo)]

[[Category:World record holders]]
[[Category:Notable 3x3 solvers|Valk, Mats]]
[[Category:Notable 4x4 solvers|Valk, Mats]]
[[Category:Notable speedcubers|Valk, Mats]]
[[Category:Notable cubers|Valk, Mats]]
[[Category:People]]

LPELL

2011-03-22T19:45:49Z

Mvcuber12: /* R BL */

{{Method Infobox
|name=LPELL
|image=LPELLinfo.png
|proposers=[[Kenneth Gustavsson]]
|year=2011
|anames=
|variants=[[ZBF2L]], [[VHF2L]]
|steps=2 or 1.5
|algs=2x6 or 2x48
|moves=? [[HTM]]
|purpose=[[FMC]], [[Speedsolving]]
}}
'''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:===
This is diveded into two [[sub step]]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 [[ZBF2L]].
* '''LPEPLL''', place the last pair and permute all edges, that are six cases and their mirrors.

LPELL is mabye not so useful for [[speedsolving]] but for [[FMC]], after the step is done you will have [[L4C]] left, 1:3 times it will be only [[L3C]] and 1:324 you will have a compleate 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 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 ZBF2L)

=LPEPLL Cases=
{{Algnote}}
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==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== R LB ===
{{case
|image=LPELL_RLB.jpg
|name=R LB
|methods=LPEPLL
|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 Amtisune.}}
{{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%" |

=== R RB ===
{{case
|image=LPELL_RRB.jpg
|name=R RB
|methods=LPEPLL
|optimal=3 [[HTM]]
|text=Z edges, just place from U2 position.}}
{{Alg|R U2 R'}}
|-valign="top"
| width="50%" |

=== R LR ===
{{case
|image=LPELL_RLR.jpg
|name=R LR
|methods=LPEPLL
|optimal=3 [[HTM]]
|text=The usual R U' R' pair.}}
{{Alg|R U' R'}}
| width="50%" |

=== R RL ===
{{case
|image=LPELL_RRL.jpg
|name=R RL
|methods=LPEPLL
|optimal=7 [[HTM]]
|text=Unexpected conjugate to solve.}}
{{Alg|R2 D L' B2 L D' R2 }}
|-valign="top"
| width="50%" |

=== R BL ===
{{case
|image=LPELL_RBL.jpg
|name=R BL
|methods=LPEPLL
|optimal=7 [[HTM]]
|text=Sune style solution.}}
{{Alg|R U R' U' R U' R'}}
{{Alg|R U' R' U R U2 R' }}
| width="50%" |

=== R BR ===
{{case
|image=LPELL_RBR.jpg
|name=R BR
|methods=LPEPLL
|optimal=7 [[HTM]]
|text=A 3-cycle commutator.}}
{{Alg|L' U2 R U R' U2 L}}
|}

==L side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== L RB ===
{{case
|image=LPELL_LRB.jpg
|name=L RB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=Mirror of R LB.}}
{{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%" |

=== L LB ===
{{case
|image=LPELL_LLB.jpg
|name=L LB
|methods=LPEPLL
|optimal=3 [[HTM]]
|text=Mirror of R RB.}}
{{Alg|L' U2 L}}
|-valign="top"
| width="50%" |

=== L RL ===
{{case
|image=LPELL_LRL.jpg
|name=L RL
|methods=LPEPLL
|optimal=3 [[HTM]]
|text=Mirror of R LR.}}
{{Alg|L' U L}}
| width="50%" |

=== L LR ===
{{case
|image=LPELL_LLR.jpg
|name=L LR
|methods=LPEPLL
|optimal=7 [[HTM]]
|text=Mirror of R RL.}}
{{Alg|L2 D' R B2 R' D L2 }}
|-valign="top"
| width="50%" |

=== L BR ===
{{case
|image=LPELL_LBR.jpg
|name=L BR
|methods=LPEPLL
|optimal=7 [[HTM]]
|text=Mirror of R BL.}}
{{Alg|L' U' L U L' U L}}
| width="50%" |

=== L BL ===
{{case
|image=LPELL_LBL.jpg
|name=L BL
|methods=LPEPLL
|optimal=7 [[HTM]]
|text=Mirror of R BR.}}
{{Alg|R U2 L' U' L U2 R'}}
|}

[[Category:Methods]]
[[Category:3x3x3 Methods]]
[[Category:Fewest Moves Methods]]
[[Category:Last Layer Methods]]
[[Category:Cubing Terminology]]
[[Category:Abbreviations and Acronyms]]
[[Category:Algorithms]]
[[Category:Sub Steps]]

__NOTOC__

Speedsolving.com Wiki - User contributions [en]

Mats Valk

LPELL