Speedsolving.com Wiki - User contributions [en]

Duplex method

2019-02-09T20:28:42Z

Kirjava:

{{Method Infobox
|name=Duplex
|image=Duplex_method.gif
|proposers=[[Thom Barlow]]
|year=2012
|steps=2
|algs=32 (default list) or custom
|moves=irrelevant
|purpose=
* [[Speedsolving]]
}}

'''Duplex''' is an experimental speedcubing method that aims to produce better solutions than traditional two look last layer methods.

==Forum links==
* [https://www.speedsolving.com/forum/threads/developing-a-better-ll-system.36791/ Developing a better LL system]

== External links ==
* [http://duplex.kirjava.xyz Method description]

[[Category:3x3x3 methods]]
[[Category:3x3x3 speedsolving methods]]

Duplex method

2019-02-09T20:26:51Z

Kirjava:

{{Method Infobox
|name=Duplex
|image=Duplex_method.gif
|proposers=[[Thom Barlow]]
|year=2012
|steps=2
|algs=32 (default list) or custom
|purpose=
* [[Speedsolving]]
}}

'''Duplex''' is an experimental speedcubing method that aims to produce better solutions than traditional two look last layer methods.

==Forum links==
* [https://www.speedsolving.com/forum/threads/developing-a-better-ll-system.36791/ Developing a better LL system]

== External links ==
* [http://duplex.kirjava.xyz Method description]

[[Category:3x3x3 methods]]
[[Category:3x3x3 speedsolving methods]]

File:Duplex method.gif

2019-02-09T20:25:46Z

Kirjava:

Duplex method

2019-02-09T20:22:50Z

Kirjava: Created page with "{{Method Infobox |name=Duplex |proposers=Thom Barlow |year=2012 |steps=2 |algs=32 (default list) or custom |purpose= * Speedsolving }} '''Duplex''' is a ps..."

{{Method Infobox
|name=Duplex
|proposers=[[Thom Barlow]]
|year=2012
|steps=2
|algs=32 (default list) or custom
|purpose=
* [[Speedsolving]]
}}

'''Duplex''' is a pseudo-[[1LLL]] method that aims to produce better solutions than traditional two look last layer methods.

==Forum links==
* [https://www.speedsolving.com/forum/threads/developing-a-better-ll-system.36791/
Developing a better LL system]

== External links ==
* [http://duplex.kirjava.xyz Method description]

[[Category:3x3x3 methods]]
[[Category:3x3x3 speedsolving methods]]

OLLCP

2015-11-13T00:35:08Z

Kirjava:

''This page is about the OLLCP [[method substep]]. For the [[alg]]s, see [[OLLCP (few algs)]].''

{{Substep Infobox
|name=OLLCP
|image=OLLCP.png
|proposers=Various
|year=
|anames=[[CLL+EO]], [[CEOLL]], [[OCPLL]]
|variants=[[CLLEF]]
|subgroup=
|algs=331
|moves=~11
|purpose=
* [[Speedsolving]]
|previous=[[F2L cube state]]
|next=[[LL:EO+CO+CP cube state]]
}}

'''Orientation of Last Layer and Corner Permutation'''
'''OLLCP''' is an [[experimental method|experimental]] [[LL]] method which both [[OLL|orients the last layer]] and [[CLL|solves the corners]]. Thus after this step only [[EPLL]] remains. The price to get there however is a high algorithm count (300+). Only a very few number of people use the full set, but a number of people use the subsets [[COLL]] and [[CLLEF]]. Several people came up with the idea, some of them after they wanted to re-learn some OLL algorithms and noticed the new algorithms had a different effect on the corners. By 'recycling' the old OLL algorithms it is sometimes very easy and fast to be able to avoid an N perm and get higher chances of PLL-skips. Because some OLLCP algorithms are really slow and because of the high number of algorithms, it is advisable to only learn the nice and fast algorithms. A slow OLLCP plus a U perm is probably slower than a fast 'normal' OLL algorithm leaving any other PLL.

== See also ==
* [[OLLCP (few algs)]]
* [[CxLL]]
* [[EPLL]]
* [[OLLCP-A]] The subset in which all corners are oriented.

== External links ==
* [https://docs.google.com/spreadsheet/ccc?key=0Aq2MYrmu606CdFFuallJVFRDQm9FUm44ekoxbDRwQVE#gid=0 Robert Yau's OLLCP]
* [https://sites.google.com/site/piauscubingsite/3x3x3/ollcp/others Antoine Piau's OLLCP (COLL and CLLEF on another page)]
* [http://www.speedsolving.com/forum/showthread.php?t=23222 SuneOLL] Proposed system to solve all cases where the corners are already permuted
* [http://www.speedsolving.com/forum/showthread.php?31506-OLLCP-(hax) Kirjava's OLLCP (hax)] List of all cases.

[[Category:Experimental methods]]
[[Category:3x3x3 last layer substeps]]

OLLCP

2013-07-17T18:41:45Z

Kirjava:

{{Method Infobox
|name=OLLCP
|image=OLLCP.png
|proposers=Various
|year=
|anames=
|variants
|steps=1
|algs=~330
|moves=~11
|purpose=
* [[Speedsolving]]
}}

'''Orientation of Last Layer and Corner Permutation'''
'''OLLCP''' is a [[experimental method|experimental]] [[LL]] method which both [[OLL|orients the last layer]] and [[CLL|solves the corners]]. Thus after this step only [[EPLL]] remains. The price to get there however is a high algorithm count (300+). Only a very few number of people use the full set, but a number of people use the subsets [[COLL]] and [[CLLEF]]. Several people came up with the idea, some of them after they wanted to re-learn some OLL algorithms and noticed the new algorithms had a different effect on the corners. By 'recycling' the old OLL algorithms it is sometimes very easy and fast to be able to avoid an N perm and get higher chances of PLL-skips. Because some OLLCP algorithms are really slow and because of the high number of algorithms, it is advisable to only learn the nice and fast algorithms. A slow OLLCP plus a U perm is probably slower than a fast 'normal' OLL algorithm leaving any other PLL.

== See also ==
* [[CxLL]]
* [[EPLL]]
* [[OLLCP-A]] The subset in which all corners are oriented.

== External links ==
* [https://docs.google.com/spreadsheet/ccc?key=0Aq2MYrmu606CdFFuallJVFRDQm9FUm44ekoxbDRwQVE#gid=0 Robert Yau's OLLCP]
* [https://sites.google.com/site/piauscubingsite/3x3x3/ollcp/others Antoine Piau's OLLCP (COLL and CLLEF on another page)]
* [http://www.speedsolving.com/forum/showthread.php?t=23222 SuneOLL] Proposed system to solve all cases where the corners are already permuted
* [http://www.speedsolving.com/forum/showthread.php?31506-OLLCP-(hax) OLLCP (hax)] List of all cases.

[[Category:Experimental methods]]
[[Category:3x3x3 last layer substeps]]

Talk:CPEOLL

2013-07-17T10:35:35Z

Kirjava:

Added minimal content

CPEOLL

2013-07-17T10:34:43Z

Kirjava:

[http://www.speedsolving.com/forum/showthread.php?42971-CPEOLL List of algs and cases]

CFCE

2013-07-17T10:28:28Z

Kirjava: /* See also */

{{Method Infobox
|name=CFCE
|image=ELL.png
|proposers=[[Guus Razoux Schultz]]
|year=1981
|anames=CLL/ELL
|variants=[[OLL]]/[[PLL]]
|steps=4
|algs=71 to 112 F2L:0 to 41 LL: 71
|moves=54
|purpose=
* [[Speedsolving]]
}}

'''CFCE'''; Cross, F2L, CLL and ELL, a [[LBL]] where the first two layers are solved simultaneously by forming a [[cross]] and then fill in the [[F2L]] slots with [[pair]]s. The [[last layer]] is solved in two looks, first all the corners are done in the [[CLL]] step and then, for completion, all the edges in the [[ELL]] step.

== The Steps ==

1. '''[[Cross]]'''

First, make a cross on any side of the cube. This entails solving all of the edges with a given color to their proper positions.

2. '''[[F2L]] (First Two Layers)'''

In this step you fill in the slots where the corners of the cross are missing. For each insertion, a corner and an edge are placed simultaneously. There are 41 basic cases for this step, but it can be learned intuitively.

3. '''[[CLL algorithms (3x3x3)|CLL]] (Corners of the Last Layer)'''

Next, solve all last layer corners in one of 42 algorithms.

4. '''[[ELL]] (Edges of the Last Layer)'''

Finally, you finish the cube by solving all the last layer edges. There are 29 algorithms.

== Origin of the Method ==
[[Guus Razoux Schultz]] used the full method in the 1982 WC finals, where he got second place.

== See also ==
* [[Cross]]
* [[XCross]]
* [[F2L]]
* [[CLL]]/[[ELL]], [[CLL algorithms (3x3x3)]]
* [[OLLCP]] .. ''CLL and EO in one look.''
* [[CxLL]]

{{F2L}}

{{3CLL}}

{{ELL}}

== External links ==

[[Category:3x3x3 methods]]
[[Category:3x3x3 speedsolving methods]]
[[Category:SpeedBLD Methods]]

OLLCP-A

2013-07-17T10:27:03Z

Kirjava:

'''OLLCP-A''', ''corner permutation and edges orientation of the last layer'', an [[experimental method]] for the [[3x3x3 cube]] that [[permute]]s the [[last layer]] [[corner]]s and [[orient]]s the last layer [[edge]]s preserving [[F2L]]. This is the second last step and the goal is to reach [[EPLL]]. Normally it would be used as a add on to the [[Fridrich method]] the times [[CO]] skips (occures 1:27 times) but it may be used as a second step in a 3-look last layer where the first step is to orient the corners.

OLLCP-A is a sub group of CEOLL or CLLEO (CLL + EO), the same as OCPLL or [[OLLCP]] (OLL + CP), a very advanced method with more than 300 cases that solves all last layer but EPLL in one look.

===See also===
* [[OLL]], [[PLL]], [[CLL]], [[ELL]]
* [[OLLCP]]
* [[Fridrich Method]]
* [http://www.speedsolving.com/forum/showthread.php?t=23005 Thread discussing this method]
* [http://www.speedsolving.com/forum/showthread.php?21210-KCLL Some algorithms]

=OLLCP-A cases=
There are 15 cases, three of them have corners correctly permuted ([[CLL]] skip) and may be solved in one look using [[ELL]], two has got edges oriented and may be solved in one look using [[PLL]] ([[OLL]] skip). Removing those cases it is only 10 left (2 are mirror cases) and of those 4 may be solved using [[J-PLL]] + M setup and one can be solved using [[Y-PLL]] (or [[V-PLL]]) with a M move setup.

== Corners permuted ==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|
===Adjacent flip===
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|
[[File:CPEOLL PA.jpg]]
|

{{Alg|M U M' U2 M U M'}}
{{Alg|(y2) M' U M U2 M' U M}}
{{Alg|Rw U R' U' M U R U' R'}}
<center>Use [[ELL]] to solve in one look.</center>

|}

|

===Opposite flip===
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|
[[File:CPEOLL PO.jpg]]
|

{{Alg|(x') M' U' R U M U' R' U (x)}}
{{Alg|(R U R' U') M' (U R U' r')}}
<center>Use [[ELL]] to solve in one look.</center>

|}

|}
{|border="0" width="50%" valign="top" cellpadding="3"
|-valign="top"
|

===4-flip===
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|
[[File:CPEOLL P4.jpg]]
|

{{Alg|M' U2 M U2 M' U M U2 M' U2 M (U')}}
{{Alg|r U R' U' M2 U R U' R' U' M' (U)}}
<center>Use [[ELL]] to solve in one look.</center>

|}
|}

== Edges oriented ==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|
===Adjacent PLL===
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|
[[File:CPEOLL AO.jpg]]
|

{{Alg|R L U2 R' U' R U2 L' U R' (U')}}
<center>Use [[PLL]] to solve in one look.</center>

|}

|

===Diagonal PLL===
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|
[[File:CPEOLL DO.jpg]]
|

{{Alg|R' U L' U2 R U' L d' L U' R U2 L' U R'}}
<center>Use [[PLL]] to solve in one look.</center>

|}

|}

== Adjacent corners ==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|
===FR-flip===
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|
[[File:CPEOLL AFR.jpg]]
|
{{Alg|(Y) R' F R' F2 L F' L' F2 R2}}
{{Alg|(y' x') (L' U L') U2 (R U' R') U2' L2 (x)}}
{{Alg|r U R' U' r' F R2 U' R' U' R U R' F'}}
|}

|

===RB-flip===
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|
[[File:CPEOLL ARB.jpg]]
|
{{Alg|(y) L F' L F2 R' F R F2 L2}}
{{Alg|(y' x') (R U' R) U2' (L' U L) U2 R2 (x)}}
{{Alg|(y2) l' U' L U l F' L2 U L U L' U' L F}}
|}

|}

{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|

===BL-flip===
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|
[[File:CPEOLL ABL.jpg]]
|
{{Alg|(x') L2 U2 R U R' U2 L U' r}}
{{Alg|(y2 x) R2 U2 L U L' U2 R U' l}}
|}

|

===LF-flip===
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|
[[File:CPEOLL ALF.jpg]]
|

{{Alg|(x) L2 U2 R' U' R U2 L' U r'}}
{{Alg|r U R' F' R U R' U' R' F R2 U' r'}}

|}

|}

{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|

===FB-flip===
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|
[[File:CPEOLL AM.jpg]]
|
{{Alg|F R U' R' U R U R2 F' r U R U' r'}}
{{Alg|r U r' F' R U R' U' R' F R r U' r'}}
{{Alg|R U R' F' U' F R2 U' L' U R' U' M' (x')}}
{{Alg|(y) R U R2 U' R' F R F' U F R2 U R' U' F'}}
{{Alg|(y') R' U2 R U2 R' U R U R' F' U' F U' R}}
{{Alg|L U F' U F U L' U L F' U L F L2}}
{{Alg|(y) R U2 r U R' U' r' U F R F' U R'}}
{{Alg|(y) R2 U R2 B L F' U2 F L' B' U' R2}}

|}

|

===RL-flip===
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|
[[File:CPEOLL AS.jpg]]
|
{{Alg|(x') R2 U' R' U l' F' U' F R U R'}}
{{Alg|(y) R U' R' F' U F l U' R U R2 (x)}}
|}

|}
{|border="0" width="50%" valign="top" cellpadding="3"
|-valign="top"
|

===4-flip (adjacent)===
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|
[[File:CPEOLL A4.jpg]]
|
{{Alg|F R' F R2 U R' U' F2 U' r U' r' F}}
{{Alg|(y') M' U L2 B2 L U R' U2 L U' M R}}
{{Alg|(y2) R2 (y) M' U M (y') l U' R U2 L' U L U2 (x)}}
{{Alg|L2 (y') M' U' M (y) r' U L' U2 R U' R' U2 (x)}}
|}
|}

== Diagonal corners ==

{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|

===Adjacent flip===
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|
[[File:CPEOLL DFR.jpg]]
|
{{Alg|(y) R b' R2 U' R D' R2 D R' U R2 b R'}}
{{Alg|(y2) S R2 D R' U R D' R2 d' l' U' L}}
|}
|

===Opposite flip===
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|
[[File:CPEOLL DM.jpg]]
|
{{Alg|(y) R' U L' U2 R U' (x') U L' U2 R U' L U2 M'}}
{{Alg|L' U l d R2 D R' U' R D' R2 S'}}
{{Alg|(y) R' F' U2 F U' R U R2 F R F' U2 R}}
{{Alg|R U' R2' F R F' R d' R U2 R' F'}}
|}
|}

{|border="0" width="50%" valign="top" cellpadding="3"
|-valign="top"
|

===4-flip (diagonal)===
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|
[[File:CPEOLL D4.jpg]]
|

{{Alg|R F' U2 R2 F' R F2 R' F R2 U2 F R'}}
{{Alg|R2 U2 M F2 U' R2 U2 F2 U R2 U2 F2 M'}}
{{Alg|x (U R' D' R2 U2' D B2) (U' R' D' R U' R' U' R2 D) x'}}
{{Alg|R' U2 R' F2 R U R U' R' U R' F' R U' F2 U2 R}}
{{Alg|R' U2 F2 U R' F R U' R U R' U' R' F2 R U2 R}}

|}
|}

[[Category:Experimental methods]]
[[Category:3x3x3 methods]]

__NOTOC__

Talk:OLLCP-A

2013-07-17T10:25:29Z

Kirjava:

Changed CPEOLL to OLLCP-A after generating algs for actual CPEOLL and realising that this subset should be called something else.

Talk:CPEOLL

2013-07-17T10:24:31Z

Kirjava: Kirjava moved page Talk:CPEOLL to Talk:OLLCP-A: Realised system is missnamed after making actual CPEOLL

#REDIRECT [[Talk:OLLCP-A]]

Talk:OLLCP-A

2013-07-17T10:24:31Z

Kirjava: Kirjava moved page Talk:CPEOLL to Talk:OLLCP-A: Realised system is missnamed after making actual CPEOLL

CPEOLL

2013-07-17T10:24:31Z

Kirjava: Kirjava moved page CPEOLL to OLLCP-A: Realised system is missnamed after making actual CPEOLL

#REDIRECT [[OLLCP-A]]

OLLCP-A

2013-07-17T10:24:29Z

Kirjava: Kirjava moved page CPEOLL to OLLCP-A: Realised system is missnamed after making actual CPEOLL

'''CPEOLL''', ''corner permutation and edges orientation of the last layer'', an [[experimental method]] for the [[3x3x3 cube]] that [[permute]]s the [[last layer]] [[corner]]s and [[orient]]s the last layer [[edge]]s preserving [[F2L]]. This is the second last step and the goal is to reach [[EPLL]]. Normally it would be used as a add on to the [[Fridrich method]] the times [[CO]] skips (occures 1:27 times) but it may be used as a second step in a 3-look last layer where the first step is to orient the corners.

CPEOLL is a sub group of CEOLL or CLLEO (CLL + EO), the same as OCPLL or [[OLLCP]] (OLL + CP), a very advanced method with more than 300 cases that solves all last layer but EPLL in one look.

===See also===
* [[OLL]], [[PLL]], [[CLL]], [[ELL]]
* [[OLLCP]]
* [[Fridrich Method]]
* [http://www.speedsolving.com/forum/showthread.php?t=23005 Thread discussing this method]
* [http://www.speedsolving.com/forum/showthread.php?21210-KCLL Some algorithms]

=CPEOLL cases=
There are 15 cases, three of them have corners correctly permuted ([[CLL]] skip) and may be solved in one look using [[ELL]], two has got edges oriented and may be solved in one look using [[PLL]] ([[OLL]] skip). Removing those cases it is only 10 left (2 are mirror cases) and of those 4 may be solved using [[J-PLL]] + M setup and one can be solved using [[Y-PLL]] (or [[V-PLL]]) with a M move setup.

== Corners permuted ==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|
===Adjacent flip===
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|
[[File:CPEOLL PA.jpg]]
|

{{Alg|M U M' U2 M U M'}}
{{Alg|(y2) M' U M U2 M' U M}}
{{Alg|Rw U R' U' M U R U' R'}}
<center>Use [[ELL]] to solve in one look.</center>

|}

|

===Opposite flip===
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|
[[File:CPEOLL PO.jpg]]
|

{{Alg|(x') M' U' R U M U' R' U (x)}}
{{Alg|(R U R' U') M' (U R U' r')}}
<center>Use [[ELL]] to solve in one look.</center>

|}

|}
{|border="0" width="50%" valign="top" cellpadding="3"
|-valign="top"
|

===4-flip===
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|
[[File:CPEOLL P4.jpg]]
|

{{Alg|M' U2 M U2 M' U M U2 M' U2 M (U')}}
{{Alg|r U R' U' M2 U R U' R' U' M' (U)}}
<center>Use [[ELL]] to solve in one look.</center>

|}
|}

== Edges oriented ==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|
===Adjacent PLL===
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|
[[File:CPEOLL AO.jpg]]
|

{{Alg|R L U2 R' U' R U2 L' U R' (U')}}
<center>Use [[PLL]] to solve in one look.</center>

|}

|

===Diagonal PLL===
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|
[[File:CPEOLL DO.jpg]]
|

{{Alg|R' U L' U2 R U' L d' L U' R U2 L' U R'}}
<center>Use [[PLL]] to solve in one look.</center>

|}

|}

== Adjacent corners ==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|
===FR-flip===
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|
[[File:CPEOLL AFR.jpg]]
|
{{Alg|(Y) R' F R' F2 L F' L' F2 R2}}
{{Alg|(y' x') (L' U L') U2 (R U' R') U2' L2 (x)}}
{{Alg|r U R' U' r' F R2 U' R' U' R U R' F'}}
|}

|

===RB-flip===
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|
[[File:CPEOLL ARB.jpg]]
|
{{Alg|(y) L F' L F2 R' F R F2 L2}}
{{Alg|(y' x') (R U' R) U2' (L' U L) U2 R2 (x)}}
{{Alg|(y2) l' U' L U l F' L2 U L U L' U' L F}}
|}

|}

{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|

===BL-flip===
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|
[[File:CPEOLL ABL.jpg]]
|
{{Alg|(x') L2 U2 R U R' U2 L U' r}}
{{Alg|(y2 x) R2 U2 L U L' U2 R U' l}}
|}

|

===LF-flip===
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|
[[File:CPEOLL ALF.jpg]]
|

{{Alg|(x) L2 U2 R' U' R U2 L' U r'}}
{{Alg|r U R' F' R U R' U' R' F R2 U' r'}}

|}

|}

{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|

===FB-flip===
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|
[[File:CPEOLL AM.jpg]]
|
{{Alg|F R U' R' U R U R2 F' r U R U' r'}}
{{Alg|r U r' F' R U R' U' R' F R r U' r'}}
{{Alg|R U R' F' U' F R2 U' L' U R' U' M' (x')}}
{{Alg|(y) R U R2 U' R' F R F' U F R2 U R' U' F'}}
{{Alg|(y') R' U2 R U2 R' U R U R' F' U' F U' R}}
{{Alg|L U F' U F U L' U L F' U L F L2}}
{{Alg|(y) R U2 r U R' U' r' U F R F' U R'}}
{{Alg|(y) R2 U R2 B L F' U2 F L' B' U' R2}}

|}

|

===RL-flip===
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|
[[File:CPEOLL AS.jpg]]
|
{{Alg|(x') R2 U' R' U l' F' U' F R U R'}}
{{Alg|(y) R U' R' F' U F l U' R U R2 (x)}}
|}

|}
{|border="0" width="50%" valign="top" cellpadding="3"
|-valign="top"
|

===4-flip (adjacent)===
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|
[[File:CPEOLL A4.jpg]]
|
{{Alg|F R' F R2 U R' U' F2 U' r U' r' F}}
{{Alg|(y') M' U L2 B2 L U R' U2 L U' M R}}
{{Alg|(y2) R2 (y) M' U M (y') l U' R U2 L' U L U2 (x)}}
{{Alg|L2 (y') M' U' M (y) r' U L' U2 R U' R' U2 (x)}}
|}
|}

== Diagonal corners ==

{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|

===Adjacent flip===
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|
[[File:CPEOLL DFR.jpg]]
|
{{Alg|(y) R b' R2 U' R D' R2 D R' U R2 b R'}}
{{Alg|(y2) S R2 D R' U R D' R2 d' l' U' L}}
|}
|

===Opposite flip===
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|
[[File:CPEOLL DM.jpg]]
|
{{Alg|(y) R' U L' U2 R U' (x') U L' U2 R U' L U2 M'}}
{{Alg|L' U l d R2 D R' U' R D' R2 S'}}
{{Alg|(y) R' F' U2 F U' R U R2 F R F' U2 R}}
{{Alg|R U' R2' F R F' R d' R U2 R' F'}}
|}
|}

{|border="0" width="50%" valign="top" cellpadding="3"
|-valign="top"
|

===4-flip (diagonal)===
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
|
[[File:CPEOLL D4.jpg]]
|

{{Alg|R F' U2 R2 F' R F2 R' F R2 U2 F R'}}
{{Alg|R2 U2 M F2 U' R2 U2 F2 U R2 U2 F2 M'}}
{{Alg|x (U R' D' R2 U2' D B2) (U' R' D' R U' R' U' R2 D) x'}}
{{Alg|R' U2 R' F2 R U R U' R' U R' F' R U' F2 U2 R}}
{{Alg|R' U2 F2 U R' F R U' R U R' U' R' F2 R U2 R}}

|}
|}

[[Category:Experimental methods]]
[[Category:3x3x3 methods]]

__NOTOC__

OLLCP

2013-07-17T10:23:15Z

Kirjava: /* See also */

{{Method Infobox
|name=OLLCP
|image=OLLCP.png
|proposers=Various
|year=
|anames=
|variants
|steps=1
|algs=~330
|moves=~11
|purpose=
* [[Speedsolving]]
}}

'''Orientation of Last Layer and Corner Permutation'''
'''OLLCP''' is a [[experimental method|experimental]] [[LL]] method which both [[OLL|orients the last layer]] and [[CLL|solves the corners]]. Thus after this step only [[EPLL]] remains. The price to get there however is a high algorithm count (300+). Only a very few number of people use the full set, but a number of people use the subsets [[COLL]] and [[CLLEF]]. Several people came up with the idea, some of them after they wanted to re-learn some OLL algorithms and noticed the new algorithms had a different effect on the corners. By 'recycling' the old OLL algorithms it is sometimes very easy and fast to be able to avoid an N perm and get higher chances of PLL-skips. Because some OLLCP algorithms are really slow and because of the high number of algorithms, it is advisable to only learn the nice and fast algorithms. A slow OLLCP plus a U perm is probably slower than a fast 'normal' OLL algorithm leaving any other PLL.

== See also ==
* [[CxLL]]
* [[EPLL]]

== External links ==
* [https://docs.google.com/spreadsheet/ccc?key=0Aq2MYrmu606CdFFuallJVFRDQm9FUm44ekoxbDRwQVE#gid=0 Robert Yau's OLLCP]
* [https://sites.google.com/site/piauscubingsite/3x3x3/ollcp/others Antoine Piau's OLLCP (COLL and CLLEF on another page)]
* [http://www.speedsolving.com/forum/showthread.php?t=23222 SuneOLL] Proposed system to solve all cases where the corners are already permuted
* [http://www.speedsolving.com/forum/showthread.php?31506-OLLCP-(hax) OLLCP (hax)] List of all cases.

[[Category:Experimental methods]]
[[Category:3x3x3 last layer substeps]]

Thom Barlow

2013-05-24T08:10:18Z

Kirjava:

{{Infobox
|NAME=Thom Barlow
|IMAGE=ThomBarlow.jpg
|IMAGEYEAR=2010
|ALIASES=Kirjava, Kir, snkenjoi
|COUNTRY=United Kingdom
|BIRTHDATE=
|AGE=
|JOBS=
|YEARSACTIVE=2004-present
|ID=2006BARL01
|FAMOUSFOR=[[K4]]
}}

'''Thom Barlow''' is a [[United Kingdom|British]] speedcuber from Manchester, United Kingdom. He is the inventor of the [[K4]] method, a non-reduction 4x4 speedsolving method. Thom is a co-host of the [[CubeCast Podcast]].

Thom averages sub-11 with his main method, [[Roux]], which makes him one of the fastest Roux solvers. Additionally, he is known for his wide speedcubing knowledge, having done sub-20 singles using 20 different methods.

Thom is active under the username Kirjava (or simply "kir") on the [[Speedsolving Forums]]. At the same time that he contributes frequently to speedcubing theory in such threads as Random Cubing Discussion, he is well known for his snide/immature/off-the-wall/insulting/sarcastic posts. For these stunts he is hated by some and adored by as many others. He has a five-page-long infraction list.

Thom is a member of [[Team Sharp|Team #]].

== Sample quotations ==
* "[X|Y|Z] = XYX'ZY'Z'

Used to use this for generating intuitive 5 cycles." [http://www.speedsolving.com/forum/showthread.php?22862-Random-Cubing-Discussion&p=561928#post561928] http://www.youtube.com/watch?v=y3fGelHdkXo
* "I've always been arrogant. I can't help but insult the verbal diarrhea you're inflicting on me." [http://www.speedsolving.com/forum/showthread.php?28763-Which-one-is-faster-ZZ-or-CFOP&p=562141#post562141]
* "it's stupid ou take teh case and smash the stack

all you have to make is the slice ollowing not smooth the n it flows now and bad

no problem with the solving balls" [http://www.speedsolving.com/forum/showthread.php?28795-Rubik-s-360-in-Competition&p=563983&viewfull=1#post563983]
* "This isn't trying to appeal to people who can't XYX'Y' in the first place." [http://www.speedsolving.com/forum/showthread.php?28789-New-notation-idea.&p=566263#post566263]
* "I think you should leave." [http://www.speedsolving.com/forum/showthread.php?22616-CubeCast-Episode-19-Ville-Sepp%E4nen.-Didn-t-say-spoop-in-the-show.&p=574553#post574553]
* "not enough furries" [http://www.speedsolving.com/forum/showthread.php?29414-May-21st-O&p=578003#post578003]
* "A good start would be to work out how to find webpages that contain information on CLL." [http://www.speedsolving.com/forum/showthread.php?29691-CLL-HELP&p=585111#post585111]
* "I just read my post back. Sometimes this forum makes me feel like a goddamn babysitter." [http://www.speedsolving.com/forum/showthread.php?29787-What-s-the-diference(LL-Petrus)&p=587579&viewfull=1#post587579]
* "Study that page like it's boobs." [http://www.speedsolving.com/forum/showthread.php?8710-The-one-answer-question-thread&p=642366&viewfull=1#post642366]

From the [[Sebastián Pino Castillo]] incident:
* "Kirjava: Why? I like cum [smiley]" [http://www.speedsolving.com/forum/showthread.php?29717-Sebasti%E1n-Pino-Castillo-Clock-WRs-Invalid&p=587673&viewfull=1#post587673]
* "Kirjava: Le puedo mostrar fotos de mi verga si te gusta <3" [http://www.speedsolving.com/forum/showthread.php?29717-Sebasti%E1n-Pino-Castillo-Clock-WRs-Invalid&p=587673&viewfull=1#post587673]
* "oh god I'm a slut" [http://www.speedsolving.com/forum/showthread.php?29717-Sebasti%E1n-Pino-Castillo-Clock-WRs-Invalid&p=587675&viewfull=1#post587675]

== See also ==
* [[K4]]
* [[CubeCast Podcast]]

== External links ==
* [http://snk.digibase.ca/ Thom Barlow's website]
* [http://www.youtube.com/snkenjoi Thom Barlow's Youtube Channel]
* [http://www.speedsolving.com/forum/member.php?43-Kirjava Thom Barlow's Speedsolving forums profile]
* [http://www.speedsolving.com/forum/search.php?do=finduser&userid=43&starteronly=1&contenttype=vBForum_Thread Created Forum Threads]

[[Category:3x3x3 solvers|Barlow, Thom]]
[[Category:Roux users|Barlow, Thom]]
[[Category:Method inventors|Barlow, Thom]]
[[Category:Speedcubers|Barlow, Thom]]

File:ThomBarlow.jpg

2012-05-19T12:12:49Z

Kirjava: uploaded a new version of "File:ThomBarlow.jpg"

File:ThomBarlow.jpg

2012-05-08T22:16:19Z

Kirjava: uploaded a new version of "File:ThomBarlow.jpg": gsdhruirtiyr

File:ThomBarlow.jpg

2012-05-08T22:15:40Z

Kirjava: uploaded a new version of "File:ThomBarlow.jpg": Reverted to version as of 22:04, 8 May 2012

File:ThomBarlow.jpg

2012-05-08T22:09:58Z

Kirjava: uploaded a new version of "File:ThomBarlow.jpg": wtf image editing

File:ThomBarlow.jpg

2012-05-08T22:05:13Z

Kirjava: uploaded a new version of "File:ThomBarlow.jpg": Reverted to version as of 05:51, 16 January 2011

File:ThomBarlow.jpg

2012-05-08T22:04:00Z

Kirjava: uploaded a new version of "File:ThomBarlow.jpg"

Table abuse

2012-05-08T21:59:36Z

Kirjava:

In [[one-handed speedsolving]], '''table abuse''' is the technique of making use of the table during a solve. [[Roux]] OH solvers are especially known for using the table for making [[M-slice]] turns, and have turned this into a real style; [[Thom Barlow]] is believed to be the first to popularise this.

The concept of "table abuse" was originally negative, as some people thought it went against the spirit of one-handed solving to be so reliant on the surface. Indeed, the [[WCA]] regulations between 2004 and 2007 [http://worldcubeassociation.org/regulations/regulations2004.html][http://worldcubeassociation.org/regulations/regulations2005.html][http://worldcubeassociation.org/regulations/regulations2006.html][http://worldcubeassociation.org/regulations/regulations2007.html] actually forbade the use of the table to assist with turning in OH (although it is now allowed):

: Article C: One-handed Solving
: ...
: During the solve no other body part or the table or any other available object may touch the puzzle. Once a competitor touches the puzzle with one hand, he may not touch the puzzle with the other hand.
: If the competitor drops the puzzle unintentionally during a solve, the competitor may start doing moves again when the puzzle has no contact with the surface anymore.
The mention of table was removed in the 2008 regulations [http://worldcubeassociation.org/regulations/regulations2008.html#onehandedsolving], thus legalising any amount of table use in official solves. However, until 2010 many people still asked if table use was allowed. Some, like Thom Barlow, dispute the term "abuse" and think there should be no stigma about using the table as much as necessary. [http://www.speedsolving.com/forum/showthread.php?36613-One-handed-Roux-cube&p=738768&viewfull=1#post738768]

== Angles ==
Most Roux practitioners of table abuse press on the cube's DR edges at a 45 degree angle onto the table. Another method is to lean on the FR edge at a 45 degree angle (see Alex Lau's video in External Links).

== See Also ==
* [[Roux]]
* [[OH]]

== External Links ==
* [http://www.speedsolving.com/forum/showthread.php?19900-21.42-oh-avg12 Dan Cohen's 21.42 OH avg12] (Fridrich)
* [http://www.speedsolving.com/forum/showthread.php?23414-Table-Abuse-aka-RouxOH-Avg-of-5-25.05 Waffo's Table Abuse aka RouxOH - Avg of 5 25.05]
* [http://www.youtube.com/watch?v=aIyKjfAHr7I&context=C3b06e09ADOEgsToPDskKP8MJzXXvEkhrGaFmHVgWZ Alex Lau 24.25 avg5 OH] (Roux)
* [http://www.youtube.com/watch?v=y3fGelHdkXo Thom Barlow 19.86 avg5 (One Handed)] (Roux)

WCA Regulations 2012

2011-12-07T12:17:08Z

Kirjava: /* New Event: Skewb */

This is a place to help collect all the available information for the WCA Regulations Committee to draft the 2012 regulations. For each topic, please create a section, and add bullet points with links to threads/posts that best represent the issue and what to do about it.

== New Event: Skewb ==
* [http://worldcubeassociation.org/forum/viewtopic.php?f=4&t=854 WCA Thread]
The most popular and commonly requested new event.

== New Event: Team Blindfolded ==
* [http://www.worldcubeassociation.org/forum/viewtopic.php?f=4&t=830&sid=b8a51f93559638dc00a9e46e08d71532 WCA thread] from Jan. 2009
* [http://www.speedsolving.com/forum/showthread.php?34006-WCA-Regulations-2012-Proposed-New-Event-Team-BLD Speedsolving.com thread]. In order for this to become an event, we need very clear rules on how to implement it.

== External Assistance ==
* [http://www.speedsolving.com/forum/showthread.php?32756-Improving-WCA-Regulation-A5b Speedsolving.com Thread]. A5b is vague on what kind of things can be assistance.

WCA Regulations 2012

2011-12-07T12:16:44Z

Kirjava:

This is a place to help collect all the available information for the WCA Regulations Committee to draft the 2012 regulations. For each topic, please create a section, and add bullet points with links to threads/posts that best represent the issue and what to do about it.

== New Event: Skewb ==
* [http://worldcubeassociation.org/forum/viewtopic.php?f=4&t=854]
The most popular and commonly requested new event.

== New Event: Team Blindfolded ==
* [http://www.worldcubeassociation.org/forum/viewtopic.php?f=4&t=830&sid=b8a51f93559638dc00a9e46e08d71532 WCA thread] from Jan. 2009
* [http://www.speedsolving.com/forum/showthread.php?34006-WCA-Regulations-2012-Proposed-New-Event-Team-BLD Speedsolving.com thread]. In order for this to become an event, we need very clear rules on how to implement it.

== External Assistance ==
* [http://www.speedsolving.com/forum/showthread.php?32756-Improving-WCA-Regulation-A5b Speedsolving.com Thread]. A5b is vague on what kind of things can be assistance.

Thom Barlow

2011-11-28T01:24:43Z

Kirjava:

{{Infobox
|NAME=Thom Barlow
|IMAGE=ThomBarlow.jpg
|IMAGEYEAR=2010
|ALIASES=Kirjava, Kir, snkenjoi
|COUNTRY=United Kingdom
|BIRTHDATE=
|AGE=
|JOBS=
|YEARSACTIVE=2004-present
|ID=2006BARL01
|FAMOUSFOR=[[K4]]
}}

'''Thom Barlow''' is a British speedcuber from Manchester, United Kingdom. He is the inventor of the [[K4]] method, a non-reduction 4x4 speedsolving method. Thom is a co-host of the [[CubeCast Podcast]].

Thom averages sub-11 with his main method, [[Roux]], which makes him one of the fastest Roux solvers. Additionally, he is known for his wide speedcubing knowledge, having done sub-20 singles using 20 different methods.

Thom is active under the username Kirjava (or simply "kir") on the [[Speedsolving Forums]]. At the same time that he contributes frequently to speedcubing theory in such threads as Random Cubing Discussion, he is well known for his snide/immature/off-the-wall/insulting/sarcastic posts. For these stunts he is hated by some and adored by as many others. He has a three-page-long infraction list.

Thom is a member of [[Team Sharp|Team #]].

== Sample Quotations ==
* "[X|Y|Z] = XYX'ZY'Z'

Used to use this for generating intuitive 5 cycles." [http://www.speedsolving.com/forum/showthread.php?22862-Random-Cubing-Discussion&p=561928#post561928]http://www.youtube.com/watch?v=y3fGelHdkXo
* "I've always been arrogant. I can't help but insult the verbal diarrhea you're inflicting on me." [http://www.speedsolving.com/forum/showthread.php?28763-Which-one-is-faster-ZZ-or-CFOP&p=562141#post562141]
* "it's stupid ou take teh case and smash the stack

all you have to make is the slice ollowing not smooth the n it flows now and bad

no problem with the solving balls" [http://www.speedsolving.com/forum/showthread.php?28795-Rubik-s-360-in-Competition&p=563983&viewfull=1#post563983]
* "This isn't trying to appeal to people who can't XYX'Y' in the first place." [http://www.speedsolving.com/forum/showthread.php?28789-New-notation-idea.&p=566263#post566263]
* "I think you should leave." [http://www.speedsolving.com/forum/showthread.php?22616-CubeCast-Episode-19-Ville-Sepp%E4nen.-Didn-t-say-spoop-in-the-show.&p=574553#post574553]
* "not enough furries" [http://www.speedsolving.com/forum/showthread.php?29414-May-21st-O&p=578003#post578003]
* "A good start would be to work out how to find webpages that contain information on CLL." [http://www.speedsolving.com/forum/showthread.php?29691-CLL-HELP&p=585111#post585111]
* "I just read my post back. Sometimes this forum makes me feel like a goddamn babysitter." [http://www.speedsolving.com/forum/showthread.php?29787-What-s-the-diference(LL-Petrus)&p=587579&viewfull=1#post587579]
* "Study that page like it's boobs." [http://www.speedsolving.com/forum/showthread.php?8710-The-one-answer-question-thread&p=642366&viewfull=1#post642366]

From the [[Sebastián Pino Castillo]] incident:
* "Kirjava: Why? I like cum [smiley]" [http://www.speedsolving.com/forum/showthread.php?29717-Sebasti%E1n-Pino-Castillo-Clock-WRs-Invalid&p=587673&viewfull=1#post587673]
* "Kirjava: Le puedo mostrar fotos de mi verga si te gusta <3" [http://www.speedsolving.com/forum/showthread.php?29717-Sebasti%E1n-Pino-Castillo-Clock-WRs-Invalid&p=587673&viewfull=1#post587673]
* "oh god I'm a slut" [http://www.speedsolving.com/forum/showthread.php?29717-Sebasti%E1n-Pino-Castillo-Clock-WRs-Invalid&p=587675&viewfull=1#post587675]

== See Also ==
* [[K4]]
* [[CubeCast Podcast]]

== External Links ==
* [http://snk.digibase.ca/ Thom Barlow's website]
* [http://www.youtube.com/snkenjoi Thom Barlow's Youtube Channel]
* [http://www.speedsolving.com/forum/member.php?43-Kirjava Thom Barlow's Speedsolving forums profile]
* [http://snk.digibase.ca/k4/ 4x4x4 Method]
* [http://www.speedsolving.com/forum/showthread.php?26342-Kirjava-Meep-Method-for-Skewb Skewb Method]
* [http://www.speedsolving.com/forum/showthread.php?28778-Kirjava-s-3x3x5-Method 3x3x5 Method]
* [http://www.speedsolving.com/forum/showthread.php?31506-OLLCP-(hax) OLLCP Algorithms]
* [http://www.speedsolving.com/forum/showthread.php?23222-SuneOLL SuneOLL Algorithms]
* [http://www.speedsolving.com/forum/showthread.php?20355-CMLL CMLL Algorithms]
* [http://www.speedsolving.com/forum/showthread.php?22737-ELL ELL Algorithms]
* [http://www.speedsolving.com/forum/showthread.php?21210-KCLL CLLEO/KCLL Notes]
* [http://www.youtube.com/watch?v=UYvgEL5Qwkk Sub 20 with 20 different methods]
* [http://www.youtube.com/watch?v=y3fGelHdkXo One handed Roux technique demonstration]

[[Category:Notable Speedcubers|Barlow, Thom]]
[[Category:Notable Method Inventors|Barlow, Thom]]
[[Category:Notable Cubers|Barlow, Thom]]
[[Category:People]]

Category talk:Methods

2011-09-17T13:10:38Z

Kirjava:

== Stuff ==
The categorisation is pretty weird. Just look at 3x3x3, most methods can be for speed/speedBLD/FMC yet specific methods are given specific attributes.

Also Per and Nicolas are listed as proposers for Cage and Sandwich. I'm pretty sure that they're only developers and not proposers.
--[[User:Kirjava|Kirjava]] 09:10, 17 September 2011 (EDT)

== Method Pages Categorisation ==
All methods have now been placed into carefully chosen categories. Please ensure the correct categories are added when new method pages are added, as it will mean that they will automatically show-up in the relevant category overview pages.
-- [[User:Cride5|Cride5]] 23:59, 9 September 2009 (UTC)

== Removal of External Links from Method List ==
All external links were moved to the detailed method pages to prevent duplication of information.
-- [[User:Cride5|Cride5]] 23:59, 9 September 2009 (UTC)

Talk:Salvia Method

2011-09-17T13:05:19Z

Kirjava: Created page with "How can David claim a 44 moves average with his weird ass F2L and four look last layer? Anyone got proof or anything? I'd quite like to edit this page like i did to Snyder. --~~~~"

How can David claim a 44 moves average with his weird ass F2L and four look last layer? Anyone got proof or anything? I'd quite like to edit this page like i did to Snyder.

--[[User:Kirjava|Kirjava]] 09:05, 17 September 2011 (EDT)

Jessica Fridrich

2011-09-14T21:53:51Z

Kirjava:

{{Infobox
|NAME=Jessica Fridrich
|IMAGE=JessicaFridrich.jpg
|IMAGEYEAR=
|ALIASES=
|COUNTRY=Czech Republic/USA
|BIRTHDATE=
|AGE=
|JOBS=
|YEARSACTIVE=1982-
|ID=1982FRID01
|FAMOUSFOR=[[Fridrich method]]
}}

'''Jessica Fridrich''' is a Czech-American speedcuber and documented and popularised the [[Fridrich method]].

== Links ==
* [http://www.ws.binghamton.edu/fridrich/cube.html Jessica Fridrich's speed cubing page]

[[Category:Notable Speedcubers|Fridrich, Jessica]]
[[Category:Notable Cubers|Fridrich, Jessica]]
[[Category:People]]

{{Stub}}

CFOP method

2011-09-14T21:52:31Z

Kirjava:

{{Method Infobox
|name=Fridrich
|image=Fridrich_method.gif
|proposers=[[David Singmaster]] [[Ren Schoof]] [[Jessica Fridrich]] [[Hans Dockhorn]] [[Anneke Treep]]
|year=1981
|anames=CFOP
|variants=[[CLL]]/[[ELL]], [[VH]], [[ZB]], [[MGLS-F]]
|steps=4
|algs=78 to 119 F2L:0 to 41 LL: 78
|moves=56
|purpose=
* [[Speedsolving]]
* [[Speed BLD]]
* [[One-Handed Solving]]
* [[Solving with Feet]]
}}

'''CFOP''' (aka The '''Fridrich Method'''); ''Cross, F2L, OLL and PLL'', was popularized by [[Jessica Fridrich]]. It is similar to the [[Layer-By-Layer]] (LBL) [[method]], because some of the steps are the same. However, the full Fridrich method uses many more algorithms than the layer by layer method, and combines some steps from the LBL method into one step. A very large number of people use this method, so there's a huge support network, and almost everyone will be able to help with learning it. The vast majority of the fastest cubers use this method (although that does not mean this is the only fast method).
The fact that the name Fridrich method is used for this method can be discussed. Fridrich was the first to publish and popularize the method although several other people also invented this method at the same time. A 'better' but less used name for this method would simply be the CFOP method.

== The Steps ==

1. '''[[Cross]]'''

First, make a cross on any side of the cube. This entails solving all of the edges with a given color to their proper positions.

2. '''[[F2L]] (First Two Layers)'''

In this step you fill in the slots where the corners of the cross are missing. For each insertion, a corner and an edge are placed simultaneously. There are 41 basic cases for this step, but it can be learned intuitively.

3. '''[[OLL]] (Orient the Last Layer)'''

Next, you make the entire top side of the cube a solid color. This requires 57 algorithms, but can be broken down into two steps (2 Look OLL), which only requires 9 algorithms.

4. '''[[PLL]] (Permute the Last Layer)'''

Finally, you finish the cube by permuting the top layer of the cube. There are 21 algorithms to learn, but this step can be done into two steps, (2 Look PLL), which includes just 6 algorithms.

== Pros ==

This method is relatively easy to understand when compared to other methods. Therefore, it is the most tested and most popular method used. It has a reasonable number of algorithms to learn, and sub 15 second averages are definitely possible. This method has been used to set many world records. It takes less thinking than block-building methods because it's more algorithm based.

== Cons ==

Learning all of the algorithms takes some time, and it requires a lot of practice to solve the F2L consistently in 10 seconds or less. Also, it has a slightly higher move count when compared to block building methods.

== Origin of the Method ==

[[Jessica Fridrich]] is often erroneously attributed with having 'invented' the Fridrich (or CFOP) method. However, in reality a number of developments made in the early 80's by other cubers contributed to the method as it is today. The constituent techniques and their original proposers are as follows:
* The [[Cross]]: David Singmaster
* [[F2L]] (4x corner + edge pairs): [[Ren Schoof]] and possibly others.
* [[OLL]]/[[PLL]]: [[Hans Dockhorn]], [[Anneke Treep]], with many algorithms developed by [[Jessica Fridrich]]

During the resurgence in popularity of speedcubing in 2003 there was a general lack of information for learning how to speedsolve the cube. Jessica's speedcubing web page offered a vast wealth of information for people entering the sport, including a full description of the CFOP method along with lists of algorithms which could be used. As a result, many who learned from the page began to call their method "Fridrich's method", which explains its predominant use today.

== See Also ==
* [[Cross]]
* [[XCross]]
* [[F2L]]
* [[OLL]]/[[PLL]]

{{F2L}}

{{OLL}}

{{PLL}}

== External Links ==

* [http://solvethecube.110mb.com/ Joël van Noort's tutorial]
* [http://erikku.er.funpic.org/rubik/Fridrich.html Erik Akkersdijk's tutorial]
* [http://www.cubefreak.net/Fridrich/main.html Shotaro Makisumi's tutorial]
* [http://www.ws.binghamton.edu/fridrich/cube.html Jessica's Homepage]
* [http://www.youtube.com/watch?v=k-xbcAMfWwM Badmephisto's Intuitive F2L Tutorial]
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?t=2322 Fridrich Method] - info on its origin.

[[Category:Methods]]
[[Category:3x3x3 Methods]]
[[Category:3x3x3 Speedsolving Methods]]
[[Category:SpeedBLD Methods]]

Fridrich Method

2011-09-14T21:51:43Z

Kirjava: I make militant edits

#REDIRECT [[CFOP]]

[[Category:Cubing Terminology]]
[[Category:Abbreviations and Acronyms]]

OLLCP

2011-09-14T21:48:39Z

Kirjava: bcoz trivial idea around since 80s

Fridrich Method

2011-09-14T21:45:50Z

Kirjava: either add every variation or none. god damn self promotion.

{{Method Infobox
|name=Fridrich
|image=Fridrich_method.gif
|proposers=[[David Singmaster]] [[Ren Schoof]] [[Jessica Fridrich]] [[Hans Dockhorn]] [[Anneke Treep]]
|year=1981
|anames=CFOP
|variants=[[CLL]]/[[ELL]], [[VH]], [[ZB]], [[MGLS-F]]
|steps=4
|algs=78 to 119 F2L:0 to 41 LL: 78
|moves=56
|purpose=
* [[Speedsolving]]
* [[Speed BLD]]
* [[One-Handed Solving]]
* [[Solving with Feet]]
}}

The '''Fridrich Method''', also '''CFOP'''; ''Cross, F2L, OLL and PLL'', was popularized by [[Jessica Fridrich]]. It is similar to the [[Layer-By-Layer]] (LBL) [[method]], because some of the steps are the same. However, the full Fridrich method uses many more algorithms than the layer by layer method, and combines some steps from the LBL method into one step. A very large number of people use this method, so there's a huge support network, and almost everyone will be able to help with learning it. The vast majority of the fastest cubers use this method (although that does not mean this is the only fast method).
The fact that the name Fridrich method is used for this method can be discussed. Fridrich was the first to publish and popularize the method although several other people also invented this method at the same time. A 'better' but less used name for this method would simply be the CFOP method.

== The Steps ==

1. '''[[Cross]]'''

First, make a cross on any side of the cube. This entails solving all of the edges with a given color to their proper positions.

2. '''[[F2L]] (First Two Layers)'''

In this step you fill in the slots where the corners of the cross are missing. For each insertion, a corner and an edge are placed simultaneously. There are 41 basic cases for this step, but it can be learned intuitively.

3. '''[[OLL]] (Orient the Last Layer)'''

Next, you make the entire top side of the cube a solid color. This requires 57 algorithms, but can be broken down into two steps (2 Look OLL), which only requires 9 algorithms.

4. '''[[PLL]] (Permute the Last Layer)'''

Finally, you finish the cube by permuting the top layer of the cube. There are 21 algorithms to learn, but this step can be done into two steps, (2 Look PLL), which includes just 6 algorithms.

== Pros ==

This method is relatively easy to understand when compared to other methods. Therefore, it is the most tested and most popular method used. It has a reasonable number of algorithms to learn, and sub 15 second averages are definitely possible. This method has been used to set many world records. It takes less thinking than block-building methods because it's more algorithm based.

== Cons ==

Learning all of the algorithms takes some time, and it requires a lot of practice to solve the F2L consistently in 10 seconds or less. Also, it has a slightly higher move count when compared to block building methods.

== Origin of the Method ==

[[Jessica Fridrich]] is often erroneously attributed with having 'invented' the Fridrich (or CFOP) method. However, in reality a number of developments made in the early 80's by other cubers contributed to the method as it is today. The constituent techniques and their original proposers are as follows:
* The [[Cross]]: David Singmaster
* [[F2L]] (4x corner + edge pairs): [[Ren Schoof]] and possibly others.
* [[OLL]]/[[PLL]]: [[Hans Dockhorn]], [[Anneke Treep]], with many algorithms developed by [[Jessica Fridrich]]

During the resurgence in popularity of speedcubing in 2003 there was a general lack of information for learning how to speedsolve the cube. Jessica's speedcubing web page offered a vast wealth of information for people entering the sport, including a full description of the CFOP method along with lists of algorithms which could be used. As a result, many who learned from the page began to call their method "Fridrich's method", which explains its predominant use today.

== See Also ==
* [[Cross]]
* [[XCross]]
* [[F2L]]
* [[OLL]]/[[PLL]]

{{F2L}}

{{OLL}}

{{PLL}}

== External Links ==

* [http://solvethecube.110mb.com/ Joël van Noort's tutorial]
* [http://erikku.er.funpic.org/rubik/Fridrich.html Erik Akkersdijk's tutorial]
* [http://www.cubefreak.net/Fridrich/main.html Shotaro Makisumi's tutorial]
* [http://www.ws.binghamton.edu/fridrich/cube.html Jessica's Homepage]
* [http://www.youtube.com/watch?v=k-xbcAMfWwM Badmephisto's Intuitive F2L Tutorial]
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?t=2322 Fridrich Method] - info on its origin.

[[Category:Methods]]
[[Category:3x3x3 Methods]]
[[Category:3x3x3 Speedsolving Methods]]
[[Category:SpeedBLD Methods]]

Jessica Fridrich

2011-09-14T21:43:06Z

Kirjava: c'mon guys

{{Infobox
|NAME=Jessica Fridrich
|IMAGE=JessicaFridrich.jpg
|IMAGEYEAR=
|ALIASES=
|COUNTRY=Czech Republic/USA
|BIRTHDATE=
|AGE=
|JOBS=
|YEARSACTIVE=1982-
|ID=1982FRID01
|FAMOUSFOR=[[Fridrich method]]
}}

'''Jessica Fridrich''' is a Czech-American speedcuber and documented the [[Fridrich method]].

== Links ==
* [http://www.ws.binghamton.edu/fridrich/cube.html Jessica Fridrich's speed cubing page]

[[Category:Notable Speedcubers|Fridrich, Jessica]]
[[Category:Notable Cubers|Fridrich, Jessica]]
[[Category:People]]

{{Stub}}

Thom Barlow

2011-09-12T23:06:48Z

Kirjava: /* External Links */

{{Infobox
|NAME=Thom Barlow
|IMAGE=ThomBarlow.jpg
|IMAGEYEAR=2010
|ALIASES=Kirjava, Kir, snkenjoi
|COUNTRY=United Kingdom
|BIRTHDATE=
|AGE=
|JOBS=
|YEARSACTIVE=2006-present
|ID=2006BARL01
|FAMOUSFOR=[[K4]]
}}

'''Thom Barlow''' is a British speedcuber from Manchester, United Kingdom. He is the inventor of the [[K4]] method, a non-reduction 4x4 speedsolving method. Thom is a co-host of the [[CubeCast Podcast]].

Thom averages sub-11 with his main method, [[Roux]], which makes him one of the fastest Roux solvers. Additionally, he is known for his wide speedcubing knowledge, having done sub-20 singles using 20 different methods.

Thom is active under the username Kirjava (or simply "kir") on the [[Speedsolving Forums]]. At the same time that he contributes frequently to speedcubing theory in such threads as Random Cubing Discussion, he is well known for his snide/immature/off-the-wall/insulting/sarcastic posts. For these stunts he is hated by some and adored by as many others. He has a three-page-long infraction list.

Thom is a member of [[Team Sharp|Team #]].

== Sample Quotations ==
* "[X|Y|Z] = XYX'ZY'Z'

Used to use this for generating intuitive 5 cycles." [http://www.speedsolving.com/forum/showthread.php?22862-Random-Cubing-Discussion&p=561928#post561928]http://www.youtube.com/watch?v=y3fGelHdkXo
* "I've always been arrogant. I can't help but insult the verbal diarrhea you're inflicting on me." [http://www.speedsolving.com/forum/showthread.php?28763-Which-one-is-faster-ZZ-or-CFOP&p=562141#post562141]
* "it's stupid ou take teh case and smash the stack

all you have to make is the slice ollowing not smooth the n it flows now and bad

no problem with the solving balls" [http://www.speedsolving.com/forum/showthread.php?28795-Rubik-s-360-in-Competition&p=563983&viewfull=1#post563983]
* "This isn't trying to appeal to people who can't XYX'Y' in the first place." [http://www.speedsolving.com/forum/showthread.php?28789-New-notation-idea.&p=566263#post566263]
* "I think you should leave." [http://www.speedsolving.com/forum/showthread.php?22616-CubeCast-Episode-19-Ville-Sepp%E4nen.-Didn-t-say-spoop-in-the-show.&p=574553#post574553]
* "not enough furries" [http://www.speedsolving.com/forum/showthread.php?29414-May-21st-O&p=578003#post578003]
* "A good start would be to work out how to find webpages that contain information on CLL." [http://www.speedsolving.com/forum/showthread.php?29691-CLL-HELP&p=585111#post585111]
* "I just read my post back. Sometimes this forum makes me feel like a goddamn babysitter." [http://www.speedsolving.com/forum/showthread.php?29787-What-s-the-diference(LL-Petrus)&p=587579&viewfull=1#post587579]
From the [[Sebastián Pino Castillo]] incident:
* "Kirjava: Why? I like cum [smiley]" [http://www.speedsolving.com/forum/showthread.php?29717-Sebasti%E1n-Pino-Castillo-Clock-WRs-Invalid&p=587673&viewfull=1#post587673]
* "Kirjava: Le puedo mostrar fotos de mi verga si te gusta <3" [http://www.speedsolving.com/forum/showthread.php?29717-Sebasti%E1n-Pino-Castillo-Clock-WRs-Invalid&p=587673&viewfull=1#post587673]
* "oh god I'm a slut" [http://www.speedsolving.com/forum/showthread.php?29717-Sebasti%E1n-Pino-Castillo-Clock-WRs-Invalid&p=587675&viewfull=1#post587675]

== See Also ==
* [[K4]]
* [[CubeCast Podcast]]

== External Links ==
* [http://snk.digibase.ca/ Thom Barlow's website]
* [http://www.youtube.com/snkenjoi Thom Barlow's Youtube Channel]
* [http://www.speedsolving.com/forum/member.php?43-Kirjava Thom Barlow's Speedsolving forums profile]
* [http://snk.digibase.ca/k4/ 4x4x4 Method]
* [http://www.speedsolving.com/forum/showthread.php?26342-Kirjava-Meep-Method-for-Skewb Skewb Method]
* [http://www.speedsolving.com/forum/showthread.php?28778-Kirjava-s-3x3x5-Method 3x3x5 Method]
* [http://www.speedsolving.com/forum/showthread.php?31506-OLLCP-(hax) OLLCP Algorithms]
* [http://www.speedsolving.com/forum/showthread.php?23222-SuneOLL SuneOLL Algorithms]
* [http://www.speedsolving.com/forum/showthread.php?20355-CMLL CMLL Algorithms]
* [http://www.speedsolving.com/forum/showthread.php?22737-ELL ELL Algorithms]
* [http://www.speedsolving.com/forum/showthread.php?21210-KCLL CLLEO/KCLL Notes]
* [http://www.youtube.com/watch?v=UYvgEL5Qwkk Sub 20 with 20 different methods]
* [http://www.youtube.com/watch?v=y3fGelHdkXo One handed Roux technique demonstration]

[[Category:Notable Speedcubers|Barlow, Thom]]
[[Category:Notable Method Inventors|Barlow, Thom]]
[[Category:Notable Cubers|Barlow, Thom]]
[[Category:People]]

Thom Barlow

2011-09-12T22:58:50Z

Kirjava: Undo revision 15830 by Kirjava (talk)

{{Infobox
|NAME=Thom Barlow
|IMAGE=ThomBarlow.jpg
|IMAGEYEAR=2010
|ALIASES=Kirjava, Kir, snkenjoi
|COUNTRY=United Kingdom
|BIRTHDATE=
|AGE=
|JOBS=
|YEARSACTIVE=2006-present
|ID=2006BARL01
|FAMOUSFOR=[[K4]]
}}

'''Thom Barlow''' is a British speedcuber from Manchester, United Kingdom. He is the inventor of the [[K4]] method, a non-reduction 4x4 speedsolving method. Thom is a co-host of the [[CubeCast Podcast]].

Thom averages sub-11 with his main method, [[Roux]], which makes him one of the fastest Roux solvers. Additionally, he is known for his wide speedcubing knowledge, having done sub-20 singles using 20 different methods.

Thom is active under the username Kirjava (or simply "kir") on the [[Speedsolving Forums]]. At the same time that he contributes frequently to speedcubing theory in such threads as Random Cubing Discussion, he is well known for his snide/immature/off-the-wall/insulting/sarcastic posts. For these stunts he is hated by some and adored by as many others. He has a three-page-long infraction list.

Thom is a member of [[Team Sharp|Team #]].

== Sample Quotations ==
* "[X|Y|Z] = XYX'ZY'Z'

Used to use this for generating intuitive 5 cycles." [http://www.speedsolving.com/forum/showthread.php?22862-Random-Cubing-Discussion&p=561928#post561928]http://www.youtube.com/watch?v=y3fGelHdkXo
* "I've always been arrogant. I can't help but insult the verbal diarrhea you're inflicting on me." [http://www.speedsolving.com/forum/showthread.php?28763-Which-one-is-faster-ZZ-or-CFOP&p=562141#post562141]
* "it's stupid ou take teh case and smash the stack

all you have to make is the slice ollowing not smooth the n it flows now and bad

no problem with the solving balls" [http://www.speedsolving.com/forum/showthread.php?28795-Rubik-s-360-in-Competition&p=563983&viewfull=1#post563983]
* "This isn't trying to appeal to people who can't XYX'Y' in the first place." [http://www.speedsolving.com/forum/showthread.php?28789-New-notation-idea.&p=566263#post566263]
* "I think you should leave." [http://www.speedsolving.com/forum/showthread.php?22616-CubeCast-Episode-19-Ville-Sepp%E4nen.-Didn-t-say-spoop-in-the-show.&p=574553#post574553]
* "not enough furries" [http://www.speedsolving.com/forum/showthread.php?29414-May-21st-O&p=578003#post578003]
* "A good start would be to work out how to find webpages that contain information on CLL." [http://www.speedsolving.com/forum/showthread.php?29691-CLL-HELP&p=585111#post585111]
* "I just read my post back. Sometimes this forum makes me feel like a goddamn babysitter." [http://www.speedsolving.com/forum/showthread.php?29787-What-s-the-diference(LL-Petrus)&p=587579&viewfull=1#post587579]
From the [[Sebastián Pino Castillo]] incident:
* "Kirjava: Why? I like cum [smiley]" [http://www.speedsolving.com/forum/showthread.php?29717-Sebasti%E1n-Pino-Castillo-Clock-WRs-Invalid&p=587673&viewfull=1#post587673]
* "Kirjava: Le puedo mostrar fotos de mi verga si te gusta <3" [http://www.speedsolving.com/forum/showthread.php?29717-Sebasti%E1n-Pino-Castillo-Clock-WRs-Invalid&p=587673&viewfull=1#post587673]
* "oh god I'm a slut" [http://www.speedsolving.com/forum/showthread.php?29717-Sebasti%E1n-Pino-Castillo-Clock-WRs-Invalid&p=587675&viewfull=1#post587675]

== See Also ==
* [[K4]]
* [[CubeCast Podcast]]

== External Links ==
* [http://snk.digibase.ca/ Thom Barlow's website]
* [http://www.youtube.com/snkenjoi Thom Barlow's Youtube Channel]
* [http://www.speedsolving.com/forum/member.php?43-Kirjava Thom Barlow's Speedsolving forums profile]
* [http://snk.digibase.ca/k4/ 4x4x4 Method]
* [http://www.speedsolving.com/forum/showthread.php?26342-Kirjava-Meep-Method-for-Skewb Skewb Method]
* [http://www.speedsolving.com/forum/showthread.php?28778-Kirjava-s-3x3x5-Method 3x3x5 Method]
* [http://www.speedsolving.com/forum/showthread.php?31506-OLLCP-(hax) OLLCP Algorithms]
* [http://www.speedsolving.com/forum/showthread.php?23222-SuneOLL SuneOLL Algorithms]
* [http://www.speedsolving.com/forum/showthread.php?20355-CMLL CMLL Algorithms]
* [http://www.speedsolving.com/forum/showthread.php?22737-ELL ELL Algorithms]
* [http://www.speedsolving.com/forum/showthread.php?21210-KCLL CLLEO/KCLL Notes]
* [http://www.speedsolving.com/forum/showthread.php?21941-B2L-gt-LL-FreeFOP Birth of FreeFOP]
* [http://www.speedsolving.com/forum/showthread.php?22862-Random-Cubing-Discussion Random Cubing Discussion]
* [http://www.youtube.com/watch?v=UYvgEL5Qwkk Sub 20 with 20 different methods]
* [http://www.youtube.com/watch?v=y3fGelHdkXo One handed Roux technique demonstration]

[[Category:Notable Speedcubers|Barlow, Thom]]
[[Category:Notable Method Inventors|Barlow, Thom]]
[[Category:Notable Cubers|Barlow, Thom]]
[[Category:People]]

Thom Barlow

2011-09-12T22:57:51Z

Kirjava:

{{Infobox
|NAME=Thom Barlow
|IMAGE=ThomBarlow.jpg
|IMAGEYEAR=2010
|ALIASES=Kirjava, Kir, snkenjoi
|COUNTRY=United Kingdom
|YEARSACTIVE=2006-present
|ID=2006BARL01
|FAMOUSFOR=[[K4]]
}}

'''Thom Barlow''' is a British speedcuber from Manchester, United Kingdom. He is the inventor of the [[K4]] method, a non-reduction 4x4 speedsolving method. Thom is a co-host of the [[CubeCast Podcast]].

Thom averages sub-11 with his main method, [[Roux]], which makes him one of the fastest Roux solvers. Additionally, he is known for his wide speedcubing knowledge, having done sub-20 singles using 20 different methods.

Thom is active under the username Kirjava (or simply "kir") on the [[Speedsolving Forums]]. At the same time that he contributes frequently to speedcubing theory in such threads as Random Cubing Discussion, he is well known for his snide/immature/off-the-wall/insulting/sarcastic posts. For these stunts he is hated by some and adored by as many others. He has a three-page-long infraction list.

Thom is a member of [[Team Sharp|Team #]].

== Sample Quotations ==
* "[X|Y|Z] = XYX'ZY'Z'

Used to use this for generating intuitive 5 cycles." [http://www.speedsolving.com/forum/showthread.php?22862-Random-Cubing-Discussion&p=561928#post561928]http://www.youtube.com/watch?v=y3fGelHdkXo
* "I've always been arrogant. I can't help but insult the verbal diarrhea you're inflicting on me." [http://www.speedsolving.com/forum/showthread.php?28763-Which-one-is-faster-ZZ-or-CFOP&p=562141#post562141]
* "it's stupid ou take teh case and smash the stack

all you have to make is the slice ollowing not smooth the n it flows now and bad

no problem with the solving balls" [http://www.speedsolving.com/forum/showthread.php?28795-Rubik-s-360-in-Competition&p=563983&viewfull=1#post563983]
* "This isn't trying to appeal to people who can't XYX'Y' in the first place." [http://www.speedsolving.com/forum/showthread.php?28789-New-notation-idea.&p=566263#post566263]
* "I think you should leave." [http://www.speedsolving.com/forum/showthread.php?22616-CubeCast-Episode-19-Ville-Sepp%E4nen.-Didn-t-say-spoop-in-the-show.&p=574553#post574553]
* "not enough furries" [http://www.speedsolving.com/forum/showthread.php?29414-May-21st-O&p=578003#post578003]
* "A good start would be to work out how to find webpages that contain information on CLL." [http://www.speedsolving.com/forum/showthread.php?29691-CLL-HELP&p=585111#post585111]
* "I just read my post back. Sometimes this forum makes me feel like a goddamn babysitter." [http://www.speedsolving.com/forum/showthread.php?29787-What-s-the-diference(LL-Petrus)&p=587579&viewfull=1#post587579]
From the [[Sebastián Pino Castillo]] incident:
* "Kirjava: Why? I like cum [smiley]" [http://www.speedsolving.com/forum/showthread.php?29717-Sebasti%E1n-Pino-Castillo-Clock-WRs-Invalid&p=587673&viewfull=1#post587673]
* "Kirjava: Le puedo mostrar fotos de mi verga si te gusta <3" [http://www.speedsolving.com/forum/showthread.php?29717-Sebasti%E1n-Pino-Castillo-Clock-WRs-Invalid&p=587673&viewfull=1#post587673]
* "oh god I'm a slut" [http://www.speedsolving.com/forum/showthread.php?29717-Sebasti%E1n-Pino-Castillo-Clock-WRs-Invalid&p=587675&viewfull=1#post587675]

== See Also ==
* [[K4]]
* [[CubeCast Podcast]]

== External Links ==
* [http://snk.digibase.ca/ Thom Barlow's website]
* [http://www.youtube.com/snkenjoi Thom Barlow's Youtube Channel]
* [http://www.speedsolving.com/forum/member.php?43-Kirjava Thom Barlow's Speedsolving forums profile]
* [http://snk.digibase.ca/k4/ 4x4x4 Method]
* [http://www.speedsolving.com/forum/showthread.php?26342-Kirjava-Meep-Method-for-Skewb Skewb Method]
* [http://www.speedsolving.com/forum/showthread.php?28778-Kirjava-s-3x3x5-Method 3x3x5 Method]
* [http://www.speedsolving.com/forum/showthread.php?31506-OLLCP-(hax) OLLCP Algorithms]
* [http://www.speedsolving.com/forum/showthread.php?23222-SuneOLL SuneOLL Algorithms]
* [http://www.speedsolving.com/forum/showthread.php?20355-CMLL CMLL Algorithms]
* [http://www.speedsolving.com/forum/showthread.php?22737-ELL ELL Algorithms]
* [http://www.speedsolving.com/forum/showthread.php?21210-KCLL CLLEO/KCLL Notes]
* [http://www.speedsolving.com/forum/showthread.php?21941-B2L-gt-LL-FreeFOP Birth of FreeFOP]
* [http://www.speedsolving.com/forum/showthread.php?22862-Random-Cubing-Discussion Random Cubing Discussion]
* [http://www.youtube.com/watch?v=UYvgEL5Qwkk Sub 20 with 20 different methods]
* [http://www.youtube.com/watch?v=y3fGelHdkXo One handed Roux technique demonstration]

[[Category:Notable Speedcubers|Barlow, Thom]]
[[Category:Notable Method Inventors|Barlow, Thom]]
[[Category:Notable Cubers|Barlow, Thom]]
[[Category:People]]

Thom Barlow

2011-09-12T22:56:56Z

Kirjava: idk, too much?

{{Infobox
|NAME=Thom Barlow
|IMAGE=ThomBarlow.jpg
|IMAGEYEAR=2010
|ALIASES=Kirjava, Kir, snkenjoi
|COUNTRY=United Kingdom
|BIRTHDATE=
|AGE=
|JOBS=
|YEARSACTIVE=2006-present
|ID=2006BARL01
|FAMOUSFOR=[[K4]]
}}

'''Thom Barlow''' is a British speedcuber from Manchester, United Kingdom. He is the inventor of the [[K4]] method, a non-reduction 4x4 speedsolving method. Thom is a co-host of the [[CubeCast Podcast]].

Thom averages sub-11 with his main method, [[Roux]], which makes him one of the fastest Roux solvers. Additionally, he is known for his wide speedcubing knowledge, having done sub-20 singles using 20 different methods.

Thom is active under the username Kirjava (or simply "kir") on the [[Speedsolving Forums]]. At the same time that he contributes frequently to speedcubing theory in such threads as Random Cubing Discussion, he is well known for his snide/immature/off-the-wall/insulting/sarcastic posts. For these stunts he is hated by some and adored by as many others. He has a three-page-long infraction list.

Thom is a member of [[Team Sharp|Team #]].

== Sample Quotations ==
* "[X|Y|Z] = XYX'ZY'Z'

Used to use this for generating intuitive 5 cycles." [http://www.speedsolving.com/forum/showthread.php?22862-Random-Cubing-Discussion&p=561928#post561928]http://www.youtube.com/watch?v=y3fGelHdkXo
* "I've always been arrogant. I can't help but insult the verbal diarrhea you're inflicting on me." [http://www.speedsolving.com/forum/showthread.php?28763-Which-one-is-faster-ZZ-or-CFOP&p=562141#post562141]
* "it's stupid ou take teh case and smash the stack

all you have to make is the slice ollowing not smooth the n it flows now and bad

no problem with the solving balls" [http://www.speedsolving.com/forum/showthread.php?28795-Rubik-s-360-in-Competition&p=563983&viewfull=1#post563983]
* "This isn't trying to appeal to people who can't XYX'Y' in the first place." [http://www.speedsolving.com/forum/showthread.php?28789-New-notation-idea.&p=566263#post566263]
* "I think you should leave." [http://www.speedsolving.com/forum/showthread.php?22616-CubeCast-Episode-19-Ville-Sepp%E4nen.-Didn-t-say-spoop-in-the-show.&p=574553#post574553]
* "not enough furries" [http://www.speedsolving.com/forum/showthread.php?29414-May-21st-O&p=578003#post578003]
* "A good start would be to work out how to find webpages that contain information on CLL." [http://www.speedsolving.com/forum/showthread.php?29691-CLL-HELP&p=585111#post585111]
* "I just read my post back. Sometimes this forum makes me feel like a goddamn babysitter." [http://www.speedsolving.com/forum/showthread.php?29787-What-s-the-diference(LL-Petrus)&p=587579&viewfull=1#post587579]
From the [[Sebastián Pino Castillo]] incident:
* "Kirjava: Why? I like cum [smiley]" [http://www.speedsolving.com/forum/showthread.php?29717-Sebasti%E1n-Pino-Castillo-Clock-WRs-Invalid&p=587673&viewfull=1#post587673]
* "Kirjava: Le puedo mostrar fotos de mi verga si te gusta <3" [http://www.speedsolving.com/forum/showthread.php?29717-Sebasti%E1n-Pino-Castillo-Clock-WRs-Invalid&p=587673&viewfull=1#post587673]
* "oh god I'm a slut" [http://www.speedsolving.com/forum/showthread.php?29717-Sebasti%E1n-Pino-Castillo-Clock-WRs-Invalid&p=587675&viewfull=1#post587675]

== See Also ==
* [[K4]]
* [[CubeCast Podcast]]

== External Links ==
* [http://snk.digibase.ca/ Thom Barlow's website]
* [http://www.youtube.com/snkenjoi Thom Barlow's Youtube Channel]
* [http://www.speedsolving.com/forum/member.php?43-Kirjava Thom Barlow's Speedsolving forums profile]
* [http://snk.digibase.ca/k4/ 4x4x4 Method]
* [http://www.speedsolving.com/forum/showthread.php?26342-Kirjava-Meep-Method-for-Skewb Skewb Method]
* [http://www.speedsolving.com/forum/showthread.php?28778-Kirjava-s-3x3x5-Method 3x3x5 Method]
* [http://www.speedsolving.com/forum/showthread.php?31506-OLLCP-(hax) OLLCP Algorithms]
* [http://www.speedsolving.com/forum/showthread.php?23222-SuneOLL SuneOLL Algorithms]
* [http://www.speedsolving.com/forum/showthread.php?20355-CMLL CMLL Algorithms]
* [http://www.speedsolving.com/forum/showthread.php?22737-ELL ELL Algorithms]
* [http://www.speedsolving.com/forum/showthread.php?21210-KCLL CLLEO/KCLL Notes]
* [http://www.speedsolving.com/forum/showthread.php?21941-B2L-gt-LL-FreeFOP Birth of FreeFOP]
* [http://www.speedsolving.com/forum/showthread.php?22862-Random-Cubing-Discussion Random Cubing Discussion]
* [http://www.youtube.com/watch?v=UYvgEL5Qwkk Sub 20 with 20 different methods]
* [http://www.youtube.com/watch?v=y3fGelHdkXo One handed Roux technique demonstration]

[[Category:Notable Speedcubers|Barlow, Thom]]
[[Category:Notable Method Inventors|Barlow, Thom]]
[[Category:Notable Cubers|Barlow, Thom]]
[[Category:People]]

K4

2011-09-12T22:45:11Z

Kirjava:

{{Method Infobox
|name=K4
|image=K4.gif
|proposers=[[Thom Barlow]]
|year=2005
|anames=
|variants=[[CF3L]]
|steps=7
|moves= ~120
|algs= Mostly commutators
|purpose=|purpose=
* [[Speedsolving]]
}}

K4 mixes reduction, blockbuilding, edge pairing and direct solving techniques to produce a method that can quickly and efficiently solve a 4x4x4 (Revenge) cube.

It should be noted that while K4 is designed specifically for the 4x4x4 cube, it can be applied to any size of cube. Modifications can be made to make it friendlier to solve on the bigger (>=5x5x5) cubes.

K4 stands for Kirjava's 4x4x4 Method.

== Overview ==
The K4 Method consists of 7 steps;

1. Two opposite centres

2. Blockbuild a 1x3x4 block

3. Complete the last four centres

4. Complete the first layer

5. Rotationless F3L

6. CLL

7. 3 look ELL

== Pros ==
Small number of rotations required

Efficient movecount

Extremely good F3L lookahead

== Cons ==
Commutators are required for a good understanding of the method

ELL can be difficult for beginners to grasp

== External links: ==
* [http://snk.digibase.ca/k4/ K4 tutorial]
* [http://www.kungfoomanchu.com/guides/k4.pdf Single Page PDF Guide]

[[Category:Methods]]
[[Category:Big Cube Methods]]
[[Category:4x4x4 Methods]]
[[Category:Cubing Terminology]]
[[Category:Abbreviations and Acronyms]]

Talk:K4

2011-09-12T22:44:34Z

Kirjava:

Removing what used to be here. Kenneth can gtfo.

Also updated the page recently and made it it somewhat presentable :P

User talk:Kirjava

2011-09-12T22:43:42Z

Kirjava: Blanked the page

Snyder Method

2011-09-12T22:42:23Z

Kirjava: 40 move acerage turncount is obviously an exaggeration

{{Method Infobox
|name=Snyder
|image=Snyder.png
|proposers=[[Anthony Snyder]]
|year=1982
|anames=
|variants=[[Heise Method]]
[[Petrus]]
|steps=3-5
|moves=
|purpose=
* [[Speedsolving]] [[FMC]]
}}
The '''Snyder Method''', invented by [[Anthony Snyder]] in 1982, is both a [[fewest moves]] and a [[speedsolving]] [[method]] for the [[3x3x3 cube]]. The start is similar to [[Petrus]], forming a 2x2x2 block with optional [[XCross]]. Then a variety of methods may be used to complete the rest of the F2L except for one CE. (Anthony has since added optional starts using a 1x2x3 or a 2x2x3, also with or without the cross.) Then the final CE pair is placed while simultaneously orienting and placing a minimum of one LLE. Then all LL edges are solved together with one corner. Then the [[last three corners]] are solved.

== Claimed Advantages ==
A salient characteristic of the Snyder Method is to orient and permute each piece at each stage simultaneously. Anthony claims several advantages for this:
* Simultaneous orientation and permutation helps to visualize piece relationships, useful to intuitive solving.
* There is a mathematical advantage.
Furthermore, all such last-layer algorithms will be a subset of [[1LLL]], making the Snyder Method a possible candidate as an intermediate method for [[1LLL]].

Though there are many cases to first solving the LLE+1C, the more common cases can generally be solved in 6-10 turns, making it quite turn efficient.

Although the Snyder Method closely resembles the [[Petrus Method]] in its F2L approach, its last-layer method differs considerably. This last-layer method was independently proposed in 2005 by [[Kenneth Gustavsson]], who called it "Fish & Chips."

== A Word about Algorithms ==
Anthony found almost all of his algorithms independently and without computer aid, and claims that his method is one of the most efficient based primarily on human-generated algorithms. Anthony explained this as follows: "In the 80's there was a general stereotype that using a computer was cheating, plus [I] enjoyed thinking up [my] own algorithms." However, he plans to upgrade his method using a computer in the near future.

== Variations ==
The Snyder Method allows a number of variations to be applied wherever convenient.
* when a 2x2x3 block is not immediately apparent he will start with either a 1x2x3 or a 2x2x2, then immediately finish the 2x2x3 block with a second look, or, he puts together several CE pairs as in [[Heise]], then assembles those into a F2L minus one CE
* two or more CE may be solved simultaneously to complete the F2L faster
* the LL may be solved in 1 look rather than 2, using either a shortest-move algorithm, combination, or substitution

In the early 80's, Anthony developed a complete set of fewest-move solutions for the CE pair cases and for the [[last three corners]] cases. However, he relied more extensively on the use of combinations and exchanges to efficiently put in the LL edges + corner. He makes up for this with a large selection of approximate direct-solves on the entire LL, claiming to switch to this mode about 20% of the time.

This method requires 1-2 looks for the block+cross start, then up to 1 look each for the 1-3 CE pairs, then 1-2 looks for the last layer. Though there are a lot of looks, an attentive solver can be quite efficient, and average around 40 turns. Though a beginner will likely take a lot more than this, and a pro taking their time may get his/her average down to about 36. Many of the shorter algorithms were added throughout the 80's and 90's, and the library of LL direct solves were mostly added in the 00's.

== Publication ==
In 1981 he printed his simple solution, a 7 algorithm system that is easy to learn. It was entitled, "Tony Snyder's Simplest Solution to Solve a Rubik's Cube", and though he personally only taught a handful of people this technique, a classmate took a copy and passed it out to students in a number of schools. He has not yet put to print his advanced technique.

'''Note:''' Having complete sets of short algorithms was very unusual in the 1980's (combining 2 algs in 1-look was a common solution). [[Kenneth Gustavsson]] suggested the same LL-method ('Fish & Chips') in 2005 but with [[VHF2L]] and the rest in two clearly defined steps, [[EP]] + 1 corner (36 cases, the 'fish' step) and then [[L3C]] (22 cases, the 'chips' step), this makes a 2-look [[ZBLL]], often a little more effective than [[COLL]]/[[EPLL]].

== Example Solves ==
Here are some of Anthony's solves.
* [http://www.youtube.com/watch?v=UB2Pb9_iNBI The Snyder Method]
* [http://www.youtube.com/watch?v=fra6go0CMgI A newer demo, easier to see]
* [http://www.youtube.com/watch?v=HEKjAHDyKLo 5 solves using Snyder Method 2, showing how fast it is despite his handicaps].

== See Also ==
* [[Anthony Snyder]]
* [[Snyder Notation]]
* [[Snyder Metric]]
* [[Heise Method]]
* [[Petrus Method]]
* [[L3C]]

If you have edges oriented when starting the last layer you can often do using only Sune, double Sune (or inverse and/or mirrors), J-PLL a/b or U-PLL a/b for the first look. Here are a couple of examples that show how this is done:

'''Scramble''' '''Solution'''
F U F' L2 B' U' B U L2 F U' F' U AUF to U-PLL a on the left side, (L3C 3-twist).
L' U R U' B2 U' B2 U B2 R' L U' AUF J-PLL b, (L3C 'Anti Niklas')
B' F R2 U' R2 U R2 U F' U' B U' J-PLL b, (L3C Niklas)
R2 F2 R2 U R' F2 R U' R2 F2 R U R U left side double Antisune (L' U2 L U...)
R' F U2 F U L' U L F U' F U F R U2 left side double Antisune (again!)
B L2 F' D F' D' F2 L2 B' U' y J-PLL a (setup L' before the y for [[1LLL]])
L U2 L D' B2 D L' U2 L D' B2 D L2 U' y2 left Antisune.

Sometimes more than one of these solutions are possible. Working like this solves the step in an easy 2:5 times, maybe more. It is effective, fast and OH-friendly, but recogniton for the sune/doublesune cases is horrible without loads of practice. For the cases where two opposite edges needs to be swapped [[COLL]] is a recommended alternative and for the cases with edges correct, one or two look [[L4C]].

== External Links ==
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?24822-Tony-Snyder-solves-the-cube Tony Snyder solves the cube]

[[Category:Methods]]
[[Category:Advanced Methods]]
[[Category:3x3x3 Methods]]
[[Category:3x3x3 Speedsolving Methods]]
[[Category:Fewest Moves Methods]]
[[Category:Cubing Terminology]]

ETM

2011-09-12T22:41:25Z

Kirjava:

The '''execution turn metric''' (ETM), is a [[metric]] for the [[3x3x3]] where any perceived movement counts as a turn; this includes rotations. Therefore, the interpretation of this metric can be somewhat subjective. For example, U2 can be either 1 or 2 moves.

ETM was designed for measuring 'true' TPS by [[David Woner]]. It is intended mainly for reconstructions, where videos are available to see how many movements were actually performed.

== Example reconstruction ETM count ==
Scramble: L2 R2 U2 L2 U F2 L2 F2 U L B2 F' R B2 U' B F L F2 D'

Cross: L2 u R' F' (4 ETM, obvious)

F2L 1: L' U' L d R' U R (7 ETM, obvious)

F2L 2: y' R U' R' U2 R U' R' (8 ETM, rotation requires regrip so it is counted)

F2L 3+4: y L U2 L' R U R' (7 ETM, rotation counts, L' R counts as two moves not one, because it is performed as such)

OLL: M U' M' U' U' M U' M' (8 ETM, Slice moves are performed as slices here. The U2 is two flicks with the left index, thus two moves.

PLL: R' U2 R U' U' R' F R U R' U' R' F' R2 U' (15 ETM, the first U2 is an index-middle double flick with the right hand, thus one move. The second is two left indexes again, thus two. R2 is a single wrist turn, thus one.)

Total solve: 56 QTM/49 HTM/44 STM/49 ETM

== See Also ==
* [[Metric]]
* [[Move Count]]
* [[Fewest Moves]]
* [[HTM]]
* [[STM]]
* [[QTM]]
* [[ATM]]

[[Category:Cubing Terminology]]

ATM

2011-09-12T22:40:52Z

Kirjava:

The '''axial turn metric''' (ATM) is a [[metric]] for the [[3x3x3]] where any movement within the same axis counts as a single move. This includes quarter turns, half turns, slice turns, and antislice turns.

== See Also ==
* [[Metric]]
* [[Move Count]]
* [[Fewest Moves]]
* [[QTM]]
* [[HTM]]
* [[STM]]
* [[ETM]]

[[Category:Cubing Terminology]]

Slice Turn Metric

2011-09-12T22:40:45Z

Kirjava:

The '''slice turn metric''' (STM) is a [[metric]] for the [[3x3x3]] where any turn of any layer, by any angle, counts as one turn. This differs from [[HTM]] in that a slice move counts as one turn, not two. And it differs from the [[ATM]] in that it does not include anti-slice turns and other axial turns.

Cube rotations do not count as turns. STM is a very popular metric for those who use methods with many slice turns (such as [[Roux]]) although the official [[Fewest Moves]] event uses HTM.

The following algorithm would count as 10 turns STM: r2 U R' U' M U R U' R' r' (an edge 3-cycle on the front face).

== See Also ==
* [[Metric]]
* [[Move Count]]
* [[Fewest Moves]]
* [[HTM]]
* [[QTM]]
* [[ATM]]
* [[ETM]]

[[Category:Cubing Terminology]]

Quarter turn metric

2011-09-12T22:40:37Z

Kirjava:

The '''quarter turn metric''' (QTM) is a [[metric]] for the [[3x3x3]] where any turn of any face, by 90 degrees clockwise or counterclockwise, counts as 1 turn; thus it is different from the [[half turn metric]] because half turns count as two moves instead of one. It is important to note that in QTM a slice move can count as either two turns (if it is a quarter turn like M) or four turns (if it is a half turn like M2), since the centers are assumed to be fixed. Cube rotations do not count as turns, so a 'double layer' turn such as r would still count as one turn.

Thus the following algorithm would count as 12 turns QTM: r2 U R' U' M U R U' R' r' (an edge 3-cycle on the front face).

== See Also ==
* [[Metric]]
* [[Move Count]]
* [[Fewest Moves]]
* [[HTM]]
* [[STM]]
* [[ATM]]
* [[ETM]]

[[Category:Cubing Terminology]]

Move count

2011-09-12T22:40:07Z

Kirjava:

'''Move count''' is the number of [[move]]s that a [[method]] or a [[sub step]] uses. The number of moves can be measured according to several different metrics:
# Quarter turns ([[QTM]])
# Half turns ([[HTM]]), also sometimes called 'face turns' ([[FTM]])
# Slice turns ([[STM]])
# Axial turns ([[ATM]])
# Execution movements ([[ETM]])

How the steps are solved or the type of algorithms that are used may affect the move count. For example, using a [[blockbuilding]] approach during early stages of a solve is known to be very move efficient. On the other hand, if a method uses many 2-gen algs it will have a higher move count than if all sides are used. Move count efficiency is important in speedsolving, but it is often necessary to sacrifice move efficiency to improve recognition and execution. However, in fewest moves solving ([[FMC]]) move count efficiency is the sole objective.

== See Also ==
* [[Fewest Moves]]
* [[Metric]]
* [[HTM]]
* [[QTM]]
* [[STM]]
* [[ATM]]
* [[ETM]]

[[Category:Cubing Terminology]]
{{Stub}}

Half Turn Metric

2011-09-12T22:39:29Z

Kirjava:

The '''half turn metric''' (HTM), also known as the ''face turn metric'' (FTM) is a [[metric]] for the [[3x3x3]] where any turn of any face, by any angle, counts as 1 turn; thus it is different from the [[quarter turn metric]] because half turns count as one move instead of two. It is important to note that in HTM a slice move actually counts as two turns, since the centers are assumed to be fixed. Cube rotations do not count as turns, so a 'double layer' turn such as r would count as one turn.

Thus the following algorithm would count as 11 turns HTM: r2 U R' U' M U R U' R' r' (an edge 3-cycle on the front face).

== See Also ==
* [[Move Count]]
* [[Metric]]
* [[Fewest Moves]]
* [[STM]]
* [[QTM]]
* [[ATM]]
* [[ETM]]

[[Category:Cubing Terminology]]

BTM

2011-09-12T22:38:42Z

Kirjava: Created page with "The '''block turn metric''' (BTM), is a metric for bigcubes where any group of contiguous slices moving the same way is counted as one move. == See Also == * [[Move Coun..."

The '''block turn metric''' (BTM), is a [[metric]] for [[bigcubes]] where any group of contiguous slices moving the same way is counted as one move.

== See Also ==
* [[Move Count]]
* [[Metric]]
* [[Bigcubes]]

[[Category:Cubing Terminology]]