Speedsolving.com Wiki - User contributions [en]

Orozco method

2018-06-29T22:32:43Z

TDM: Formatting changes, correcting a mistake in the intro

The '''Orozco method''' is an intermediate blindsolving method invented by Gabriel Alejandro Orozco Casillas. It was popularized by [[Jayden McNeill]] as a stepping stone to full 3-style. By default, the method 21 UFR algs and 22 UF commutators (plus their inverses), but it can be applied to any set of buffers.

The method works by solving each target with one commutator. To solve any letter pair AB, simply execute "buffer -> A -> helper" followed by "helper -> B -> buffer". Note that after the first comm, the piece B has been moved to the helper position, which is why the next comm must be "helper -> B -> buffer" and not "buffer -> B -> helper". Example commutators for URB/UR helper pieces are listed below.

== Corners ==
* UFR>URB>UBL: [x R2: [D2, R U R']]
* UFR>URB>ULF: [x' R2: [R' U' R, D2]]
* UFR>URB>LUB: [R2: [R' U R, D]]
* UFR>URB>LFU: [R2: [D', R U' R']]
* UFR>URB>LDF: [R' D R, U]
* UFR>URB>LBD: [U', R D' R']
* UFR>URB>FUL: [R2: [R' U2 R, D]]
* UFR>URB>FDR: [D' R' D R, U]
* UFR>URB>FLD: [D R' D' R, U]
* UFR>URB>RDB: [U', R D R']
* UFR>URB>RFD: [R' D' R, U]
* UFR>URB>BLU: [R2: [D', R U2 R']]
* UFR>URB>BDL: [U', D' R D R']
* UFR>URB>BRD: [U', D R D' R']
* UFR>URB>DFL: [F2, l U l']
* UFR>URB>DRF: R' D R U' R D' R' U R D R' U R' D' R U'
* UFR>URB>DBR: U' R D' R' U R' D R U R' D' R U' R D R'
* UFR>URB>DLB: [l' U' l, B2]

'''twist algs''':
* UFR>URB>RBU: [U, R' D' R D R' D' R]
* UFR>URB>BRU: [U, R' D R D' R' D R]

== Edges ==
* UF>UR>UB: M2 u' M' u2 M' u' M2
* UF>UR>UL: [M2 U: [M, U2]]
* UF>UR>LU: [S', L F' L']
* UF>UR>LF: [U', R' E R]
* UF>UR>LD: [M D M', U]
* UF>UR>LB: [U', R E' R']
* UF>UR>FR: [M U M' U', R]
* UF>UR>FD: [M', R U' R' U]
* UF>UR>FL: [U', R E2 R']
* UF>UR>RB: [U2: [U', L' E L]]
* UF>UR>RD: [U', R' E' R] or [U', R E R']
* UF>UR>RF: [U2: [U', L E' L']]
* UF>UR>BU: [M, R' U' R U]
* UF>UR>BL: L' U' L' U' L U L U L U'
* UF>UR>BD: U M U M' U M U M'
* UF>UR>BR: R U R U R U' R' U' R' U'
* UF>UR>DF: M U2 M U M' U2 M' U'
* UF>UR>DR: U R' U' R U R U R U' R' U2
* UF>UR>DB: [R': [M2, U' R U]]
* UF>UR>DL: U' L' U' L U L U L U' L'

'''flip algs''':
* UF>UR>RU: R' F R U' M' U2 M U' S R' F' R S'

== See also ==
* [[Classic Pochmann]]
* [[BH]]
* [[Commutators and Conjugates]]

== External links ==
*[https://www.speedsolving.com/forum/threads/how-the-orozco-bld-method-works.60487/ How the Orozco BLD method works]

[[Category:Blindsolving methods]]
[[Category:Blindfold cubing terminology]]

VLS

2016-12-10T14:18:40Z

TDM: /* Cons */

{{Substep Infobox
|name=VLS
|image=
|proposers=[[Mats Valk]], [[Rowe Hessler]], [[Lucas Winter]]
|year=[[WV]]: 2005 The rest of VLS: 2013
|anames=VRLS, RLS
|variants=[[WV]], UF, UL, UB, UFUL, ULUB, UFUB, all edges misoriented
|subgroup=
|algs=432 (216 excluding mirrors)
|moves=9.74
|purpose=
* [[Speedsolving]]
* [[FMC]]
|previous=[[VLS]] setup cube case
|next=[[PLL]]
}}

'''VLS''', short for '''Valk Last Slot''', is a subset of [[OLS]]. The VLS substep solves the last F2L [[pair]], if the edge and corner are already [[pair]]ed in the [[LL|last layer]] and can be inserted using [U]RU'R', and also skips [[OLL]] which is the third step used in the widely popular [[CFOP]] method. VLS can be used in [[speedsolving]] or [[FMC]] to decrease move count.

==History==
A portion of VLS was previously completed and published in 2005 by [[Lucas Winter]]. The portion created by him is commonly known throughout the cubing community as [[Winter Variation]], or WV, and is one of the subsets in VLS.

The rest of VLS was later generated by speedcuber [[Mats Valk]] in 2009. He had used them somewhat often in his solves, however he did not publish them for the public and it was not commonly known that Mats used an [[OLS]] method. A few years later in 2013, [[Rowe Hessler]] had unintentionally come up with the same idea. He generated and published all of the [[algorithms]] for the last slot method on his [http://rowe.cubing.net/rls/ website], calling them "RLS" for Rowe Last Slot. Mats had later found out that Rowe had come up with the same idea and contacted him about it. They agreed to create [http://www.youtube.com/channel/UCOvpCbHRg9NSQce3is8MGNw a YouTube channel] that, for a short time, made videos about VLS cases and Rowe also created [https://www.speedsolving.com/forum/threads/ols-vls-hls-algorithms-by-mats-valk-and-rowe-hessler.44642/ a forum post] introducing the method, now calling it VLS. One year later in 2014, Rowe also created [[algdb]] pages for VLS algorithms, finally calling them "VRLS" for Valk-Rowe Last Slot, however most people still know it today by the name VLS.

==Learning Approach==
There are 8 subsets under VLS. They are named after which edges are misoriented if the F2L pair is on the right and is facing towards the solver. Note that there are mirrored cases which still fall under their unmirrored subsets. These subsets include [[WV]], UF, UL, UB, UFUL, ULUB, UFUB, and all edges. Each of these subsets include 54 algorithms, if mirrors are counted as separate cases. It is usually recommended to first learn [[WV]] and then the rest of VLS in whatever order you choose. Learn the placement of the stickers meant to be on the top face, like with [[OLL]].

==Pros==
* Move count is decreased by about 4 moves compared to normally doing the last [[F2L]] pair, then [[OLL]].
* It requires less [[look ahead]], if implemented into solves, compared to doing the last F2L pair and OLL. So, although it only saves 4 moves, decreased look ahead will definitely help your times a lot more.
* Drastically increased chance of a last layer skip.

==Cons==
* There are a total of 432 algorithms, including mirrors.

==See Also==
*[[OLS]]
*[[HLS]]
*[[VHLS]]
*[[ZBLS]]
*[[OLL]]
==External Links==
*[https://www.speedsolving.com/forum/threads/ols-vls-hls-algorithms-by-mats-valk-and-rowe-hessler.44642/ The original forum post introducing VLS and HLS]
*[http://rowe.cubing.net/rls/ All of Rowe Hessler's VLS algorithms]
*[http://www.youtube.com/channel/UCOvpCbHRg9NSQce3is8MGNw Mats Valk and Rowe Hessler's abandoned OLS YouTube channel]
[[Category:3x3x3 last slot substeps]]

VLS

2016-12-10T14:17:18Z

TDM: /* Pros */

{{Substep Infobox
|name=VLS
|image=
|proposers=[[Mats Valk]], [[Rowe Hessler]], [[Lucas Winter]]
|year=[[WV]]: 2005 The rest of VLS: 2013
|anames=VRLS, RLS
|variants=[[WV]], UF, UL, UB, UFUL, ULUB, UFUB, all edges misoriented
|subgroup=
|algs=432 (216 excluding mirrors)
|moves=9.74
|purpose=
* [[Speedsolving]]
* [[FMC]]
|previous=[[VLS]] setup cube case
|next=[[PLL]]
}}

'''VLS''', short for '''Valk Last Slot''', is a subset of [[OLS]]. The VLS substep solves the last F2L [[pair]], if the edge and corner are already [[pair]]ed in the [[LL|last layer]] and can be inserted using [U]RU'R', and also skips [[OLL]] which is the third step used in the widely popular [[CFOP]] method. VLS can be used in [[speedsolving]] or [[FMC]] to decrease move count.

==History==
A portion of VLS was previously completed and published in 2005 by [[Lucas Winter]]. The portion created by him is commonly known throughout the cubing community as [[Winter Variation]], or WV, and is one of the subsets in VLS.

The rest of VLS was later generated by speedcuber [[Mats Valk]] in 2009. He had used them somewhat often in his solves, however he did not publish them for the public and it was not commonly known that Mats used an [[OLS]] method. A few years later in 2013, [[Rowe Hessler]] had unintentionally come up with the same idea. He generated and published all of the [[algorithms]] for the last slot method on his [http://rowe.cubing.net/rls/ website], calling them "RLS" for Rowe Last Slot. Mats had later found out that Rowe had come up with the same idea and contacted him about it. They agreed to create [http://www.youtube.com/channel/UCOvpCbHRg9NSQce3is8MGNw a YouTube channel] that, for a short time, made videos about VLS cases and Rowe also created [https://www.speedsolving.com/forum/threads/ols-vls-hls-algorithms-by-mats-valk-and-rowe-hessler.44642/ a forum post] introducing the method, now calling it VLS. One year later in 2014, Rowe also created [[algdb]] pages for VLS algorithms, finally calling them "VRLS" for Valk-Rowe Last Slot, however most people still know it today by the name VLS.

==Learning Approach==
There are 8 subsets under VLS. They are named after which edges are misoriented if the F2L pair is on the right and is facing towards the solver. Note that there are mirrored cases which still fall under their unmirrored subsets. These subsets include [[WV]], UF, UL, UB, UFUL, ULUB, UFUB, and all edges. Each of these subsets include 54 algorithms, if mirrors are counted as separate cases. It is usually recommended to first learn [[WV]] and then the rest of VLS in whatever order you choose. Learn the placement of the stickers meant to be on the top face, like with [[OLL]].

==Pros==
* Move count is decreased by about 4 moves compared to normally doing the last [[F2L]] pair, then [[OLL]].
* It requires less [[look ahead]], if implemented into solves, compared to doing the last F2L pair and OLL. So, although it only saves 4 moves, decreased look ahead will definitely help your times a lot more.
* Drastically increased chance of a last layer skip.

==Cons==
* There are a total of 432 algorithms, including mirrors.
* Because of the first point, this means that if the solver were to learn full VLS, it would likely take at least a year if 1 algorithm was learned per day.

==See Also==
*[[OLS]]
*[[HLS]]
*[[VHLS]]
*[[ZBLS]]
*[[OLL]]
==External Links==
*[https://www.speedsolving.com/forum/threads/ols-vls-hls-algorithms-by-mats-valk-and-rowe-hessler.44642/ The original forum post introducing VLS and HLS]
*[http://rowe.cubing.net/rls/ All of Rowe Hessler's VLS algorithms]
*[http://www.youtube.com/channel/UCOvpCbHRg9NSQce3is8MGNw Mats Valk and Rowe Hessler's abandoned OLS YouTube channel]
[[Category:3x3x3 last slot substeps]]

Meyer method

2015-07-07T16:51:42Z

TDM: /* Overview */

{{Method Infobox
|name=Meyer
|image=
|proposers=[[Richard Meyer]]
|year= ~2007
|steps= 5
|moves=
|algs=
|purpose=
* [[Speedsolving]]
}}
{{Method Header
|listofsteps=2 opposite centers -> 1x3x4 block -> Last centers -> Remaining dedges -> Solve as [[Roux]]
|description=[[Meyer method|'''Meyer''']] is a frequently used [[speedsolving]] [[reduction]] [[method]] for the [[4x4x4 cube]].
}}

'''Meyer method''' is a 4x4 speedsolving method proposed by [[Richard Meyer]]. It can also be applied to bigger cubes.

== Overview ==
# Solve 2 opposite [[center]]s
# Solve a 1x3x4 block on the left using one of the built centers
# Solve the remaining 4 centers
# Pair up the remaining [[dedge]]s without messing up the block
# Do 3x3 stage with [[Roux]] (first block is already solved)

== External links ==
* [https://www.speedsolving.com/forum/showthread.php?53278-The-Meyer-Thread-4x4-Reduction-Sub-Method Meyer Thread]

[[Category:4x4x4 methods]]