Speedsolving.com Wiki - User contributions [en]

Sweden

2012-04-06T11:47:56Z

Kenneth: cat

[[File:Sweflag.png]]

'''Swedish speedcubing.'''

==People==
Swedish [[cuber]]s are older on average compared to the rest of the world, at least 1:10 of the Swedes that have competed are 40 years or older. Of course, most Swedish cubers are youngsters, just like in the rest of the world.

===Most notable Swedes in speedcubing:===
* [[Lars Petrus]] ... A living legend.
* [[Gunnar Krig]] ... Cubing skills, several world records.
* [[Simon Westlund]] ... Cubing skills.
* [[Anders Larsson]] ... [[WCA delegate]], 'Most countries' record holder (22 in August 2010).
* [[Kenneth Gustavsson]] ... Method developing, community activity.
* [[Rune Wesström]] ... Probably the only person in the world aged 80 or more that can solve a [[3x3x3 | cube]] in less than 60 seconds (almost sub 40 even).

'''External links:'''
* [http://www.worldcubeassociation.org/results/regions.php?regionId=Sweden&eventId=&years=&mixed=Mixed Swedish records]

==SveKub, the Swedish community==
Sweden had, since 2004, an 'official' organisation named SveKub, short for Svenska kubföreningen (Swedish cube association) that first was a registered association but now is just a network of Swedish cubers. SveKub has a website with a forum, and there is where competitions in Sweden are discussed and organised by the members of the network, besides the usual cubing forum activities, like helping new cubers, posting [[algorithm | algs]], trading cubes and such.

There is also a mostly Swedish speaking IRC channel named [[Rubik IRC Channel|#rubik]] at the Quake-net, also a place for discussions within the community.

'''External links:'''
* [http://www.svekub.se/ SveKub website]
* [http://webchat.quakenet.org/?nick=cuber_nick&channels=rubik&prompt=1 #rubik @Quakenet]

[[Category:Countries]]

Category:Countries

2012-04-06T11:47:02Z

Kenneth: Created page with "The speedcubing world."

The [[speedcubing]] world.

Hungary

2012-04-06T11:44:50Z

Kenneth: /* Well-known Cubers */ hyperlink names

'''Hungary''' is a country in [[Europe]]. It is notable for being the birthplace of the Rubik's Cube, as [[Ernő Rubik]] himself is Hungarian. Hungarian cubers have held [[WCA]] world records in 15 events.

==Well-known Cubers==

Well-known cubers from Hungary include:
* [[Bence Barát]]
* [[Milán Baticz]]
* [[Bálint Bodor]]
* [[Marcell Endrey]]
* [[Máté Horváth]]
* [[István Kocza]]
* [[Mátyás Kuti]]
* [[Róbert Örkényi]]
* [[Olivér Perge]]
* [[Ernő Rubik]]

[[Category:Countries]]

Gunnar Krig

2012-03-21T16:28:15Z

Kenneth: a -> ä

{{Infobox
|NAME=Gunnar Krig
|IMAGE=GunnarKrig.jpg
|IMAGEYEAR=!
|ALIASES=
|COUNTRY=Sweden
|BIRTHDATE=!
|AGE=!
|JOBS=!
|YEARSACTIVE=2004-present
|ID=2004KRIG01
|FAMOUSFOR=World records
}}

'''Gunnar Krig''' is a [[Sweden | Swedish]] [[cuber | speedcuber]] from Älvsjö, Stockholms Län. He set the European record for [[3x3x3]] OH in 2005, and for [[2x2x2]] twice in 2005 and once in 2006. He set the World record for 3x3x3 OH in 2009, for [[Pyraminx]] twice in 2005, and for 2x2x2 twice in 2005 and once each in 2004 and 2006.

[[Category:Notable Speedcubers|Krig, Gunnar]]
[[Category:Notable Cubers|Krig, Gunnar]]
[[Category:People]]

List of online communities

2012-03-09T09:02:19Z

Kenneth:

* [[Speedsolving Wiki]]
* [[Speedsolving Forums]]
* [[Speedcubing IRC Channel]]s

Talk:Chinese Cube Association

2012-03-04T09:13:33Z

Kenneth: Created page with "Clicking the link to the CCA web page gives a 404 error, it seems it is all dead and forgotten... So this page needs to be updated, but I havn't been around much the latets year..."

Clicking the link to the CCA web page gives a 404 error, it seems it is all dead and forgotten...

So this page needs to be updated, but I havn't been around much the latets year so I'm not sure how it all went. I leave it to someone who may have a little more information in this matter. // [[User:Kenneth|Kenneth]] 04:13, 4 March 2012 (EST)

Talk:Tripod Method

2012-03-01T06:38:14Z

Kenneth: wipe

Fewest Moves Challenge

2012-02-19T07:54:42Z

Kenneth: /* Algoritms */

''FMC redirects here. This page is about the [[WCA]] official event. For the [[online contest]], see [[Fewest Moves Challenge]].''

'''Fewest Moves''' (or '''F'''ewest '''M'''oves '''C'''hallenge, '''FMC''') is an event where competitors attempt to solve a puzzle (almost always the [[3x3x3]]) in as few moves as possible, starting from a given scramble. The usual turn metric is [[HTM]].

There is one [[WCA]]-official Fewest Moves event: writing down the shortest possible solution to a 3x3x3 scramble, with a time limit of one hour. Other types of fewest move solving have been tried in the [[Fewest Moves Challenge]], with the most popular other events being the Linear Fewest Moves event (solving the 3x3x3 with as few moves as possible, without being able to undo moves) and the event of writing down the shortest possible solution for the 3x3x3 with a time limit of one week.

The original '''Fewest Moves Challenge''' (FMC) was a challenge started by [[Dan Harris]]. It was the first online Fewest Moves competition and, although it is no longer run by Dan, it remains a good way to practice fewest moves solving. One scramble is given per event every week, and the results are typically up soon after the next round starts.

==History==

Although it is very likely that fewest moves solving was first experimented with in the 1980s, the event was popularized by [http://www.cubestation.co.uk/ Dan's Cube Station] with its Fewest Moves Challenge (FMC), which began in April 2003 and was held nearly every week for many years. The event was also held at many competitions starting with the [[World Rubik's Games Championship 2003]], and recently it has become even more popular due to the weekly competitions at the [[Speedsolving.com]] forum.

==Records==

The first world record for the WCA event was set in 2003 and was 29 moves by [[Mirek Goljan]]. He improved this result to 28 moves in 2005, a record which stood for more than three years until it was broken by [[Guus Razoux Schultz]], 27 moves in 2008. The current world record is 22 moves by Jimmy Coll of Belgium, during the Barcelona Open in 2009.

The best known unofficial result (using a properly scrambled cube) is 19 moves at the online FMC competition at fmc.mustcube.net round 203. [[Mirek Goljan]] and [[Guus Razoux Schultz]] both found a 19 move solution and claimed to find this within 20 minutes.

==Algorithms==
[[Algorithm]]s that may be used in FMC are at many pages in this wiki, se for example [[ELL]], [[LLEF]], [[L3C]] and [[L4C]].

The [[BH]] method is a nice complement for the advanced FMC competitor, learning how to deal with optimal [[commutator]]s helps a lot.

== See Also ==
* [[Fewest Moves Techniques]]
* [[Fewest Moves Methods]]
* [[Move Count]]
* [[Puzzle Theory]]
* [[Blindsolving]]
* [[One-Handed Solving]]
* [[Solving with Feet]]

== External Links ==
* [http://fmc.mustcube.net/ New FMC Website]
* [http://games.groups.yahoo.com/group/fewestmoveschallenge/ FMC Yahoo Group]
* [http://www.cubestation.co.uk/cs2/index.php?page=fmc/fmcnewsystem Dan Harris's Fewest Moves Challenge Page] (now obsolete)
* Speedsolving.com [http://www.speedsolving.com/forum/showthread.php?13599 The FMC thread]
* Speedsolving.com [http://www.speedsolving.com/forum/showthread.php?1566 Fewest Moves Tips and Techniques]
[[Category:Solving Variants]]

Fewest Moves Challenge

2012-02-19T07:54:21Z

Kenneth:

''FMC redirects here. This page is about the [[WCA]] official event. For the [[online contest]], see [[Fewest Moves Challenge]].''

'''Fewest Moves''' (or '''F'''ewest '''M'''oves '''C'''hallenge, '''FMC''') is an event where competitors attempt to solve a puzzle (almost always the [[3x3x3]]) in as few moves as possible, starting from a given scramble. The usual turn metric is [[HTM]].

There is one [[WCA]]-official Fewest Moves event: writing down the shortest possible solution to a 3x3x3 scramble, with a time limit of one hour. Other types of fewest move solving have been tried in the [[Fewest Moves Challenge]], with the most popular other events being the Linear Fewest Moves event (solving the 3x3x3 with as few moves as possible, without being able to undo moves) and the event of writing down the shortest possible solution for the 3x3x3 with a time limit of one week.

The original '''Fewest Moves Challenge''' (FMC) was a challenge started by [[Dan Harris]]. It was the first online Fewest Moves competition and, although it is no longer run by Dan, it remains a good way to practice fewest moves solving. One scramble is given per event every week, and the results are typically up soon after the next round starts.

==History==

Although it is very likely that fewest moves solving was first experimented with in the 1980s, the event was popularized by [http://www.cubestation.co.uk/ Dan's Cube Station] with its Fewest Moves Challenge (FMC), which began in April 2003 and was held nearly every week for many years. The event was also held at many competitions starting with the [[World Rubik's Games Championship 2003]], and recently it has become even more popular due to the weekly competitions at the [[Speedsolving.com]] forum.

==Records==

The first world record for the WCA event was set in 2003 and was 29 moves by [[Mirek Goljan]]. He improved this result to 28 moves in 2005, a record which stood for more than three years until it was broken by [[Guus Razoux Schultz]], 27 moves in 2008. The current world record is 22 moves by Jimmy Coll of Belgium, during the Barcelona Open in 2009.

The best known unofficial result (using a properly scrambled cube) is 19 moves at the online FMC competition at fmc.mustcube.net round 203. [[Mirek Goljan]] and [[Guus Razoux Schultz]] both found a 19 move solution and claimed to find this within 20 minutes.

==Algoritms==
[[Algorithm]]s that may be used in FMC are at many pages in this wiki, se for example [[ELL]], [[LLEF]], [[L3C]] and [[L4C]].

The [[BH]] method is a nice complement for the advanced FMC competitor, learning how to deal with optimal [[commutator]]s helps a lot.

== See Also ==
* [[Fewest Moves Techniques]]
* [[Fewest Moves Methods]]
* [[Move Count]]
* [[Puzzle Theory]]
* [[Blindsolving]]
* [[One-Handed Solving]]
* [[Solving with Feet]]

== External Links ==
* [http://fmc.mustcube.net/ New FMC Website]
* [http://games.groups.yahoo.com/group/fewestmoveschallenge/ FMC Yahoo Group]
* [http://www.cubestation.co.uk/cs2/index.php?page=fmc/fmcnewsystem Dan Harris's Fewest Moves Challenge Page] (now obsolete)
* Speedsolving.com [http://www.speedsolving.com/forum/showthread.php?13599 The FMC thread]
* Speedsolving.com [http://www.speedsolving.com/forum/showthread.php?1566 Fewest Moves Tips and Techniques]
[[Category:Solving Variants]]

Fewest Moves Challenge

2012-02-19T07:53:51Z

Kenneth: /* See Also */

''FMC redirects here. This page is about the [[WCA]] official event. For the [[online contest]], see [[Fewest Moves Challenge]].''

'''Fewest Moves''' (or '''F'''ewest '''M'''oves '''C'''hallenge, '''FMC''') is an event where competitors attempt to solve a puzzle (almost always the [[3x3x3]]) in as few moves as possible, starting from a given scramble. The usual turn metric is [[HTM]].

There is one [[WCA]]-official Fewest Moves event: writing down the shortest possible solution to a 3x3x3 scramble, with a time limit of one hour. Other types of fewest move solving have been tried in the [[Fewest Moves Challenge]], with the most popular other events being the Linear Fewest Moves event (solving the 3x3x3 with as few moves as possible, without being able to undo moves) and the event of writing down the shortest possible solution for the 3x3x3 with a time limit of one week.

The original '''Fewest Moves Challenge''' (FMC) was a challenge started by [[Dan Harris]]. It was the first online Fewest Moves competition and, although it is no longer run by Dan, it remains a good way to practice fewest moves solving. One scramble is given per event every week, and the results are typically up soon after the next round starts.

==History==

Although it is very likely that fewest moves solving was first experimented with in the 1980s, the event was popularized by [http://www.cubestation.co.uk/ Dan's Cube Station] with its Fewest Moves Challenge (FMC), which began in April 2003 and was held nearly every week for many years. The event was also held at many competitions starting with the [[World Rubik's Games Championship 2003]], and recently it has become even more popular due to the weekly competitions at the [[Speedsolving.com]] forum.

==Records==

The first world record for the WCA event was set in 2003 and was 29 moves by [[Mirek Goljan]]. He improved this result to 28 moves in 2005, a record which stood for more than three years until it was broken by [[Guus Razoux Schultz]], 27 moves in 2008. The current world record is 22 moves by Jimmy Coll of Belgium, during the Barcelona Open in 2009.

The best known unofficial result (using a properly scrambled cube) is 19 moves at the online FMC competition at fmc.mustcube.net round 203. [[Mirek Goljan]] and [[Guus Razoux Schultz]] both found a 19 move solution and claimed to find this within 20 minutes.

== See Also ==
* [[Fewest Moves Techniques]]
* [[Fewest Moves Methods]]
* [[Move Count]]
* [[Puzzle Theory]]
* [[Blindsolving]]
* [[One-Handed Solving]]
* [[Solving with Feet]]

==Algoritms==
[[Algorithm]]s that may be used in FMC are at many pages in this wiki, se for example [[ELL]], [[LLEF]], [[L3C]] and [[L4C]].

The [[BH]] method is a nice complement for the advanced FMC competitor, learning how to deal with optimal [[commutator]]s helps a lot.

== External Links ==
* [http://fmc.mustcube.net/ New FMC Website]
* [http://games.groups.yahoo.com/group/fewestmoveschallenge/ FMC Yahoo Group]
* [http://www.cubestation.co.uk/cs2/index.php?page=fmc/fmcnewsystem Dan Harris's Fewest Moves Challenge Page] (now obsolete)
* Speedsolving.com [http://www.speedsolving.com/forum/showthread.php?13599 The FMC thread]
* Speedsolving.com [http://www.speedsolving.com/forum/showthread.php?1566 Fewest Moves Tips and Techniques]
[[Category:Solving Variants]]

Template:H-PLL

2012-02-18T10:02:43Z

Kenneth: /* H Permutation */

===H Permutation===
{{case
|image=H.gif
|name=H-PLL, X-PLL
|methods=[[EPLL]], [[CPLL]], [[PLL]], [[ELL]], [[ZBLL]], [[ZZLL]]
|optimal=10 [[HTM]], 7 [[STM]]
|text=X-PLL is H-PLL + U2.
}}
{{Alg|M2 U M2 U2 M2 U M2|PLL|vidurl=http://www.youtube.com/watch?v=2oYCYc4BjaU}}
{{Alg|M2 U' M2 U2 M2 U' M2|PLL|vidurl=http://www.youtube.com/watch?v=4YqOYb6pHSs}}
{{Alg|M2 U2 M2 U' M2 U2 M2 U|PLL}}
{{Alg|U' M2 U2 M2 U M2 U2 M2|PLL}}
{{Alg|M2 U M2 U M2 U M2 U M2 U M2 U'|PLL}}
{{Alg|R2 U2 R U2 R2 U2 R2 U2 R U2 R2|PLL}}
{{Alg|R2' U2 R' U2 R2' U2' R2' U2 R' U2 R2'|PLL|vidur2=http://www.youtube.com/watch?v=HI9ff1ACklU}}
{{Alg|R2 U2 R2 U2 R2 U R2 U2 R2 U2 R2 U'|PLL}}
{{Alg|R U2 R' U' R' U' R2 U' R2 U2 R2 U2 R' U|PLL}}
{{Alg|S R U2 R2 U2 R2 U2 R S'|PLL}}
{{Alg|F2 M2 F2 U' F2 M2 F2 U|PLL}}
{{Alg|(x) U2 M2 U2 B' U2 M2 U2 B (x')|PLL}}
{{Alg|L R U2 L' R' F' B' U2 F B|PLL}}
{{Alg|L R U2 L' R' (y) L' R' U2 L R|PLL}}
{{Alg|(R' S R u) 6|PLL}}
{{Alg|R' D' R D' B D B' D R' D' R U R' D R D' B D' B' D R' D R U|PLL}}
{{Alg|(M2 U')5 M2 U|PLL}}
{{Alg|L2 U2 L' U2 L2 U2 L2 U2 L' U2 L2|PLL}}

Template:U-PLL(a)

2012-02-18T10:01:35Z

Kenneth: /* U Permutation : a */

===U Permutation : a===
{{case
|image=u1.gif
|name=U-PLL a
|methods=[[EPLL]], [[PLL]], [[ELL]], [[ZBLL]], [[BLD]]
|optimal=9 [[HTM]], 7 [[STM]]
|text=
}}
{{Alg|R2 U' R' U' R U R U R U' R|PLL}}
{{Alg|(y2) R U' R U R U R U' R' U' R2|PLL}}
{{Alg|R U R' U R' U' R2 U' R' U R' U R U2|PLL}}
{{Alg|M2 U M' U2 M U M2|PLL}}
{{Alg|(y2) M2 U M U2 M' U M2|PLL}}
{{Alg|(y') M2 u' M u2 M u' M2|PLL}}
{{Alg|(y) M2 u' M' u2 M' u' M2|PLL}}
{{Alg|(y) R2' U' S' U2 S U' R2'|PLL}}
{{Alg|(y) R2 U' (F B') R2 (F' B) U' R2|PLL}}
{{Alg|B2 U' M U2 M' U' B2|PLL}}
{{Alg|(y2) F2 U' L R' F2 L' R U' F2|PLL}}
{{Alg|M2 U' M' U2 M U2 M' U2 M U' M2|PLL}}
{{Alg|(y) R2 U' (y) r U2 r' R U2 R' (y') U R2|PLL}}
{{Alg|(y) R2 d' r U2 M U2 R' d R2|PLL}}
{{Alg|R U R' U' L' U' L U2 R U' R' U' L' U L|PLL}}

Metric

2012-02-18T09:57:30Z

Kenneth: /* Summary of different metrics */

A '''metric''' (more specifically, '''move count metric''' or '''turn metric''') is a convention for measuring [[move count]]. The same sequence of moves can have different move counts depending on the metric used.

== Summary of different metrics ==
For more details, see the respective articles.
* '''HTM'''; [[HTM|Half Turn Metric]] (or Face Turn Metric): Any face turn of any angle counts as 1 turn.
* '''QTM'''; [[QTM|Quarter Turn Metric]]: Only quarter (90-degree) face turns count as 1 turn.
* '''STM'''; [[STM|Slice Turn Metric]]: Any turn of any layer, by any angle, counts as 1 turn.
* '''ATM'''; [[ATM|Axial Turn Metric]]: Any movement within the same axis counts as 1 turn.
* '''ETM'''; [[ETM|Execution Turn Metric]]: Any perceived movement counts as 1 turn.
* '''BTM'''; [[BTM|Block Turn Metric]]: A metric for measuring movecounts on [[Bigcubes]]

== Uses ==

[[HTM]] has been used to. For example, [[God's number]] is known to be 20 in HTM. From a mathematical standpoint, however, [[QTM]] seems a more natural choice; half-turns are visibly redundant as generators.

== Debate over metric in FMC ==
[[WCA]] uses [[HTM]] in [[FMC]]. There has been a number of debates arguing for different metrics.

== See Also ==
* [[Move Count]]
* [[QTM]]
* [[HTM]]
* [[STM]]
* [[ATM]]
* [[ETM]]
* [[BTM]]

[[Category:Cubing Terminology]]

Template:U-PLL(b)

2012-02-18T09:55:15Z

Kenneth: /* U Permutation : b */ learn about HTM and STM at the Metric page :P

===U Permutation : b===
{{case
|image=u.gif
|name=U-PLL b
|methods=[[EPLL]], [[PLL]], [[ELL]], [[ZBLL]], [[BLD]]
|optimal=9 [[HTM]], 7 [[STM]]
|text=
}}
{{Alg|R' U R' U' R' U' R' U R U R2|PLL}}
{{Alg|(y2) R2 U R U R' U' R' U' R' U R'|PLL}}
{{Alg|(y2) L' U L' U' L' U' L' U L U L2|PLL}}
{{Alg|M2 U' M' U2 M U' M2|PLL}}
{{Alg|(y2) M2 U' M U2 M' U' M2|PLL}}
{{Alg|(y2) F2 U R' L F2 R L' U F2|PLL}}
{{Alg|B2 U M U2 M' U B2|PLL}}
{{Alg|(y') M2 u M' u2 M' u M2|PLL}}
{{Alg|R U' R U R U R' U' R' U' R' U2 R'|PLL}}
{{Alg|(y2) R' U' R U' R U R2 U R U' R U' R' U2|PLL}}
{{Alg|M2 U M' U2 M U2 M' U2 M U M2|PLL}}
{{Alg|L' U' L U R U R' U2 L' U L U R U' R'|PLL}}
{{Alg|(z) U2' R U R U' R' U' R' U' R U' (z')|PLL}}
{{Alg|(y2 z) U' R U' R' U' R' U' R U R U2' (z')|PLL}}
{{Alg|(y2) F2 U M' U2 M U F2|PLL}}

Anders Larsson

2012-02-17T16:51:25Z

Kenneth:

{{Infobox
|NAME=Anders Larsson
|IMAGE=AndersLarsson.jpg
|IMAGEYEAR=!
|ALIASES=
|COUNTRY=Sweden
|BIRTHDATE=1963
|AGE=49
|JOBS=
|YEARSACTIVE=2003-present
|ID=2003LARS01
|FAMOUSFOR="Most Countries" record holder, IAC head
}}

'''Anders Larsson''' is a [[Sweden | Swedish]] [[cuber | speedcuber]] currently living in Singapore. He is a [[WCA delegate]] and has been the head of the [[Independent Advisory Committee|Independent Advisory Committee (IAC)]] since its creation in 2008.

[[Category:Notable Speedcubers|Larsson, Anders]]
[[Category:Notable Cubers|Larsson, Anders]]
[[Category:People]]

PLL

2012-02-16T14:07:42Z

Kenneth: /* Y Permutation */

{{Method Infobox
|name=PLL
|image=PLLinfo.jpg
|proposers=
|year=
|anames=
|variants=
|steps=1
|algs=21
|moves=12.3 [[HTM]]
|purpose=
* [[Speedsolving]]
}}
'''PLL''' is the Permutation of the [[Last Layer]], the last step of many speedsolving methods. In this step, the pieces on the top layer have already been oriented ([[OLL]]) so that the top face has all the same color, and they can now be moved into their solved positions. There are 21 PLLs (13 if you count mirrors and inverses as being the same) and each one is named after a letter. The following page gives a list of all of the PLLs, along with a picture and a list of common [[algorithm]]s for each one. The diagrams below are top views of where you want the pieces to go. For example, the [[PLL#T_Permutation|T Permutation]] (or 'T perm') swaps the UL and UR edges, as well as the UFR and UBR corners. Make sure to try out all of the available algorithms for a case to see which one feels the fastest to you - the same algorithm may not be the fastest for everyone, and shorter algorithms are not always faster than longer ones. PLL is a subgroup of [[ZBLL]].

{{PLL}}
== See Also ==
* [[2-Look PLL]]
* [http://www.speedsolving.com/wiki/index.php/Special:AlgDB?mode=view&view=default&puzzle=3&group=PLL PLL Algorithm Database]

== External Links ==

* [http://rishidoshi.blogspot.com/2010/12/pllpatterns.html PLL Patterns and Algs] (Recognize PLLs by patterns. Printable and customizable Excel sheet by RiDo)
* [http://mordred.awardspace.us/PLLCheatSheet.pdf PLL Cheat Sheet] (Printable PDF of all PLL algorithms on a single page)
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?t=19867 Recognizing PLLs from only 2 sides]

=PLL algorithms=
{{Algnote}}
==Permutations of Edges Only==
This subgroup, [[EPLL]] is used as a [[sub step]] for many speedsolving methods, for example in the [[VH method]] ([[COLL]]).

{{H-PLL}}
{{U-PLL(a)}}
{{U-PLL(b)}}
{{Z-PLL}}

==Permutations of Corners Only==
This is also known as [[CPLL]] (Corner Permute Last Layer). There is one more case in this group, the X-PLL but that is the same alg as [[H-PLL]] + U2, see [[EPLL]].

{{A-PLL(a)}}
{{A-PLL(b)}}
{{E-PLL}}

==Permutations of Edges and Corners==

===F Permutation===
{{case
|image=f.gif
|name=F-PLL
|methods=[[PLL]], [[ZBLL]], [[ZZLL]]
|optimal=14 [[HTM]]
|text=
}}
{{Alg|R' U R U' R2 (y') R' U' R U (y x) R U R' U' R2 (x') U'|PLL}}
{{Alg|(y2) R' U2 R' d' R' F' R2 U' R' U R' F R U' F|PLL|vidurl=http://www.youtube.com/watch?v=yangrM_N1Pc#t=00m30s}}
{{Alg|(y) R' U' F' R U R' U' R' F R2 U' R' U' R U R' U R|PLL}}
{{Alg|(y2) R U' R' U R2 y R U R' U' x U' R' U R U2 (x') U|PLL}}
{{Alg|(y z) R U R' U' R U2 (z' y') R U R' U' (y x) L' U' L U L2 (x')|PLL}}
{{Alg|R' U2 R' U2 L U' R' U' R' U R U2 L' U2 R U R|PLL}}
{{Alg|L U2 L U2 R' U L U L U' L' U2 R U2 L' U' L'|PLL}}
{{Alg|(y2) M U2 r' U l' U2 r U' R2 r U2 R2 (x') U|PLL}}
{{Alg|(r U R' U') z U' (l' U2 r' U') (r U2 l' U l2) (x')|PLL}}
{{Alg|(y) F (x) R2 F R2 U' R' U l' U2 L F' L' U (x') R2 U' (x')|PLL}}
{{Alg|(y) (R U R' U R U2 R2) (U' R U' R' U2 R) U (r U R' U' r' F R F') (x')|PLL}}
{{Alg|(y) M2 U M2 (y') (R U R' U' R' F R2 U' R' U' R U R' F') (y) M2 U' M2|PLL}}
{{Alg|(y) F U' r U r' U r' F' r2 U' r' U' F' U2 F'|PLL}}

===G Permutation : a===
{{case
|image=g3.gif
|name=G-PLL a
|methods=[[PLL]], [[ZBLL]]
|optimal=12 [[HTM]]
|text=
}}
{{Alg|(y) R2' u R' U R' U' R u' R2 (y') R' U R|PLL}}
{{Alg|(y) R2 D B' U B' U' B D' R2 F' U F|PLL}}
{{Alg|(y2) F2' D R' U R' U' R D' F2 L' U L|PLL}}
{{Alg|R L U2 R' L' (y') R' U L' U2 R U' L U2|PLL}}
{{Alg|(y) d' L U' R' U L' U' L U L' U L U2 L' U R U' R' U R U' R' U2 R|PLL}}

===G Permutation : b===
{{case
|image=g2.gif
|name=G-PLL b
|methods=[[PLL]], [[ZBLL]]
|optimal=12 [[HTM]]
|text=
}}
{{Alg|R' U' R (y) R2 u R' U R U' R u' R2|PLL}}
{{Alg|R' U' R B2 D L' U L U' L D' B2|PLL}}
{{Alg|(y2) L' U' L (y') R2' u R' U R U' R u' R2|PLL}}
{{Alg|(y') R' U L' U2 R U' L (y) R L U2 L' R' U2|PLL}}
{{Alg|(y2) d R' U2 R U R' U' R U R' U' L U2 L' U' L U' L' U L U' R U L'|PLL}}

===G Permutation : c===
{{case
|image=g1.gif
|name=G-PLL c
|methods=[[PLL]], [[ZBLL]]
|optimal=12 [[HTM]]
|text=
}}
{{Alg|(y) R2' u' R U' R U R' u R2 (y) R U' R'|PLL}}
{{Alg|(y) R2' u' R U' R U R' u R2 B U' B'|PLL}}
{{Alg|(y) R2' U' R U' R U R' U R2 D' U R U' R' D|PLL}}
{{Alg|(y) R2' D' F U' F U F' D R2 B U' B'|PLL}}
{{Alg|(y2) F2' D' L U' L U L' D F2 R U' R'|PLL}}
{{Alg|L' R' U2 L R (y) L U' R U2 L' U R' U2|PLL}}
{{Alg|(y') R2' F2 R U2 R U2 R' F R U R' U' R' F R2|PLL}}
{{Alg|(y') l' U2' L' U l F' U' L U F R' F R|PLL}}
{{Alg|(y') d R' U L U' R U R' U' R U' R' U2 R U' L' U L U' L' U L U2 L'|PLL}}

===G Permutation : d===
{{case
|image=g.gif
|name=G-PLL d
|methods=[[PLL]], [[ZBLL]]
|optimal=12 [[HTM]]
|text=
}}
{{Alg|(y2) R U R' (y') R2 u' R U' R' U R' u R2|PLL}}
{{Alg|(y2) R U R' F (y') R u' R U' R' U R' u R2|PLL}}
{{Alg|(y2) R U R' F2 D' L U' L' U L' D F2|PLL}}
{{Alg|(y2) (R U R' F2) D' (L U' L' U L') u L2|PLL}}
{{Alg|U2 l2 U' L2 U' F2 L' U' R U2 L' U l (x')|PLL}}
{{Alg|(y) L U' R U2 L' U R' (y) R' L' U2 R L U2|PLL}}
{{Alg|(y) L U' R U2 L' U R' (y') L' R' U2 L R U2|PLL}}
{{Alg|(y) f R f' R2 u' R U' R' U R' u R2|PLL}}
{{Alg|(y') R' F' R F' U' L' U F R' F' L F2 R|PLL}}
{{Alg|(y') R2' F' (R U R U') (R' F' R) (U2' R' U2' R') F2 R2|PLL}}
{{Alg|(y2) d' L U2 L' U' L U L' U' L U R' U2 R U R' U R U' R' U L' U' R|PLL}}

===J Permutation : a===
{{case
|image=j1.gif
|name=J-PLL a
|methods=[[PLL]], [[ZBLL]], [[BLD]]
|optimal=10 [[HTM]]
|text=
}}
{{Alg|(y) R' U L' U2 R U' R' U2 L R U'|PLL}}
{{Alg|(y2) R' U2 R U R' U2' L U' R U L'|PLL}}
{{Alg|(y2 x) U2 r' U' r U2 l' U R' U' l2|PLL}}
{{Alg|U' L' U R' (z) R2 U R' U' R2 U D (z')|PLL}}
{{Alg|(y2) R' U2 R U R' (z) R2' U R' D R U' (z')|PLL}}
{{Alg|(y2) L U' R' U L' U2 R U' R' U2 R|PLL|vidurl=http://www.youtube.com/watch?v=0Q0aiSuVxe8}}
{{Alg|(y2) L' R' U2 R U R' U2 L U' R U|PLL}}
{{Alg|R U' L' U R' U2 L U' L' U2' L|PLL}}
{{Alg|L' U R' U2 L U' R U L' U R' U2 L U' R|PLL}}
{{Alg|L' U2 L U L' U2 R U' L U R'|PLL}}
{{Alg|R' L' d2 R U R' d2 R U' L U|PLL}}
{{Alg|L' U' L F L' U' L U L F' L2 U L U|PLL}}
{{Alg|B2' R2 U' R2' u R2 D' R2' U R2 U'|PLL}}
{{Alg|(y) R2 (U' D) R2' U' R2 U R2' D' R2 U R2' U'|PLL}}
{{Alg|(y') L' U R' U2 L U' L' U2 R L U'|PLL}}
{{Alg|(z) D R' U' R D' R (R U R' U') R2 U|PLL}}
{{Alg|R' U2' R U R' z R2 U R' D R U'|PLL}}
{{Alg|(y2) F U' R' F R2 U' R' U' R U R' F' R U R' F'|PLL}}

===J Permutation : b===
{{case
|image=j.gif
|name=J-PLL b
|methods=[[PLL]], [[ZBLL]], [[BLD]]
|optimal=10 [[HTM]]
|text=
}}
{{Alg|R U R' F' R U R' U' R' F R2 U' R' U'|PLL}}
{{Alg|R U2 R' U' R U2 L' U R' U' L|PLL}}
{{Alg|R U' L U2 R' U L' U' R U' L U2 R' U L'|PLL}}
{{Alg|(y') L U' R U2 L' U L U2 (R' L') U|PLL}}
{{Alg|L' U R U' L U2 R' U R U2' R'|PLL}}
{{Alg|(y2) R L U2 L' U' L U2 R' U L' U'|PLL}}
{{Alg|(y') L U' r U2 l' U R' U' l2 F2 L2|PLL}}
{{Alg|(y2) r2 U' L' U r' U2 R B' R' U2 (x')|PLL}}
{{Alg|(y2) F2 R U R' F2 L D' L D L2|PLL}}
{{Alg|(y2) F2 R U R' b2 R U' R U l2'|PLL}}
{{Alg|(y) R U' L U2 R' U R U2 L' R'|PLL}}

===N Permutation : a===
{{case
|image=n1.gif
|name=N-PLL a
|methods=[[PLL]], [[ZBLL]], [[ZZLL]]
|optimal=14 [[HTM]]
|text=
}}
{{Alg|(z) D R' U R2 D' R (U' D) R' U R2 D' R U' R' (z')|PLL}}
{{Alg|(z) U R' D R2 U' R (D' U) R' D R2 U' R D' R' (z')|PLL}}
{{Alg|R' U R2 B2 U R' B2' R U' B2 R2' U' R U'|PLL}}
{{Alg|R U' L d2 L' U L R' U' R U2 r' F l' U' (y2)|PLL}}
{{Alg|F' R U R' U' R' F R2 F U' R' U' R U F' R'|PLL}}
{{Alg|R U R' U (R U R' F' R U R' U' R' F R2 U' R') U2 R U' R'|PLL}}
{{Alg|L U L' (y') (R U R' F' R U R' U' R' F R2 U' R') (y') U' R U' R'|PLL}}
{{Alg|(z) U R' U' R U F R F' U' R' U F' U F U' R U' (z')|PLL}}
{{Alg|(y z) R' U R' D R2 U' R (U D') R' D R2 U' R D' (z')|PLL}}
{{Alg|L U' R U2 L' U R' L U' R U2 L' U R' U'|PLL}}
{{Alg|R U' R' U l U F U' R' F' R U' R U l' U R'|PLL}}
{{Alg|L U' L' U L F U F' L' U' L F' L F L' U L'|PLL}}
{{Alg|(z) U2 R2 U' R2 (y') R2 U2 R2 U R2 (y) R2 U2 R2 d R2 (x' y)|PLL}}

===N Permutation : b===
{{case
|image=n.gif
|name=N-PLL b
|methods=[[PLL]], [[ZBLL]], [[ZZLL]]
|optimal=14 [[HTM]]
|text=
}}
{{Alg|(z) U' R D' R2' U R' (U' D) R D' R2 U R' D R (z')|PLL}}
{{Alg|(L' U' L U) R' U2' R U R' z R2 U R' D R U' (R' U' R U)|PLL}}
{{Alg|(z) U' R D' R2 U R' U' (z') R U R' (z) R2 U R' (z') R U|PLL}}
{{Alg|(z) (D' R U' R2' D R' U)2 R (z')|PLL}}
{{Alg|R' U R U' R' F' U' F R U R' F R' F' R U' R|PLL}}
{{Alg|R U' R2' F2 U' R F2' R' U F2 R2 U R' U|PLL}}
{{Alg|R' U L' U2 R U' L R' U L' U2 R U' L U|PLL}}
{{Alg|L' U R' U2' L U' (R L') U R' U2' L U' R U|PLL}}
{{Alg|L' U L U' r' U' F' U L F L' U L' U' r U' L|PLL}}
{{Alg|R2 F2 U2 F2 U F2 R2 U2 R2 U F2 U2 R2 U|PLL}}
{{Alg|(R' U' R U') (L U' R' U) L' U2 (R U' R' U2) R (U R' U R)|PLL}}
{{Alg|(R' U R' F) R F' (R U' R') F' U (F R U R' U') R|PLL}}

===R Permutation : a===
{{case
|image=r1.gif
|name=R-PLL a
|methods=[[PLL]], [[ZBLL]]
|optimal=14 [[HTM]]
|text=
}}
{{Alg|(y') R U R' F' R U2 R' U2 R' F R U R U2 R' U'|PLL}}
{{Alg|R U2 R' U2 R B' R' U' R U l U R2 F (x)|PLL}}
{{Alg|R U' R F2 U R U R U' R' U' F2 R2 U|PLL}}
{{Alg|R U2 R' U' R' F' R U2 R U2 R' F R U' R' U|PLL}}
{{Alg|(y2 z) U R2 U' R2 U F' U' R' U R U F U2 R (z')|PLL}}
{{Alg|(y') R2 B' R' U' R' U R B R' U2 R U2 R' U'|PLL}}
{{Alg|(y2) R' U' R U2 R U2 L' R2 U R U' R L U2 R' U2|PLL}}
{{Alg|R U2 R D R' U R D' R' U' R' U R U R' U|PLL}}
{{Alg|(y2) L U2 L' U2 L F' L' U' L U L F L2 U|PLL}}
{{Alg|(y') R U' R' U' R U R D R' U' R D' R' U2 R' U'|PLL}}
{{Alg|(y') R l U' l' U' R' U l U l' U2 R U2' R' U'|PLL}}
{{Alg|(y2) U' L2 F' L' U' L' U L F L' U2 L U2 L'|PLL}}
{{Alg|(y x') R' U' F' U R' U' (x) U R' U' R' U R B R2|PLL}}

===R Permutation : b===
{{case
|image=r.gif
|name=R-PLL b
|methods=[[PLL]], [[ZBLL]]
|optimal=14 [[HTM]]
|text=
}}
{{Alg|R' U2 R U2 R' F R U R' U' R' F' R2' U'|PLL}}
{{Alg|(y) R2 B2 U' R' U' R U R U B2 R U' R U|PLL}}
{{Alg|R' U2 R U' (y') R' F R B' R' F' R (z x') R' U R' (x z')|PLL}}
{{Alg|(y2) R' U2 l R U' R' U l' U2' R F R U' R' U' R U R' F'|PLL}}
{{Alg|R' U2 R' D' R U' R' D R U R U' R' U' R U'|PLL}}
{{Alg|(y x) R2 U l U R U' l' U' l U2 R' U2 R U|PLL}}
{{Alg|(y') r' L' U r U L U' r' U' r U2 L' U2 L U|PLL}}
{{Alg|U R2 F R U R U' R' F' R U2 R' U2 R|PLL}}

===T Permutation===
{{case
|image=t.gif
|name=T-PLL
|methods=[[PLL]], [[ZBLL]], [[ZZLL]], [[BLD]]
|optimal=11 [[HTM]]
|text=
}}
{{Alg|R U R' U' R' F R2 U' R' U' R U R' F'|PLL}}
{{Alg|(y2) L' U' L U L F' L2 U L U L' U' L F|PLL}}
{{Alg|F R U' R' U R U R2 F' R U R U' R'|PLL}}
{{Alg|R2 U R2 U' R2' U' D R2 U' R2' U R2 D' |PLL}}
{{Alg|(y2) B L U' L' U L U L2 B' L U L U' L'|PLL}}
{{Alg|(y2) L2 U' L2 D F2 R2 U R2 D' F2 U|PLL}}
{{Alg|R2 U' R2 D B2 L2 U L2 D' B2 U|PLL}}
{{Alg|R2' u' R2 U R2' (y) R2 u R2' U' R2 U|PLL}}
{{Alg|R2 U R2' U' R2 U' D R2' U' R2 U R2' D'|PLL}}
{{Alg|(y2 z) U2 r' U2 r U2 (x) U2 r U2 r' U2 R (z')|PLL}}
{{Alg|R U R' U' R2 D R' U' R' U' R U (z') U2 R' U (z)|PLL}}
{{Alg|R2 U R2 U' R2 F2 U' F2 D R2 D'|PLL}}

===V Permutation===
{{case
|image=V.gif
|name=V-PLL
|methods=[[PLL]], [[ZBLL]]
|optimal=14 [[HTM]]
|text=
}}
{{Alg|R' U R' d' R' F' R2 U' R' U R' F R F|PLL}}
{{Alg|R' U R' (y) U' R' F' R2 U' R' U R' F R F|PLL}}
{{Alg|R' U R' U' (y x) R' F R' F' R2 U' R' U R U (x')|PLL}}
{{Alg|R' U R' U' (y x) R' F R' F' R2 U' R' U R U (x')|PLL}}
{{Alg|R' U R' U' (y x) R' U' R2 B' R' B R' U R U (x')|PLL}}
{{Alg|R' U R' U' (y x) R' U' R2 (x') U' R' U R' F R F|PLL}}
{{Alg|R' U R' U' B' D B' D' B2 R' B' R B R|PLL}}
{{Alg|R' U R' U' (x2 y') R' U R' U' l R U' R' U R U (x')|PLL}}
{{Alg|R' U R' U' (x' y) U' R U' R' U2 (y') R' U' R U R (x)|PLL}}
{{Alg|R' U R' U' (y) R' F' R2 U' R' U R' F R F|PLL}}
{{Alg|R' U R' U' (y) R' D R' D' R2 F' R' F R F|PLL}}
{{Alg|R' U2 R U2 L U' R' U L' U L U' R U L'|PLL}}
{{Alg|R' U2 R U2 L U' R' U r' F r U' R U L'|PLL}}
{{Alg|R2 U' (B2 U B2) (R D') (R D) R' U R U' R|PLL}}
{{Alg|(y') R' U L U' R U R' U L' U' R U2 L U2 L'|PLL}}
{{Alg|(y2) R U' L' U R' U' R U' L U R' U2 L' U2 L|PLL}}
{{Alg|L U' R' U L' U' L U' R U L' U2 R' U2 R|PLL}}
{{Alg|(y) r' F R F' r U r' F R' F' r U2 R U2 R'|PLL}}
{{Alg|(y) L' U R U' L U L' U R' U' L U2 R U2 R'|PLL}}
{{Alg|R U2 R' D R U' R U' R U R2 D R' U' R D2|PLL}}
{{Alg|(y z) U' R D R' U R U' R D' R' U R2 D R2 D' z'|PLL}}

===Y Permutation===
{{case
|image=Y.gif
|name=Y-PLL
|methods=[[PLL]], [[ZBLL]], [[BLD]]
|optimal=13 [[HTM]]
|text=
}}
{{Alg|F R U' R' U' R U R' F' R U R' U' R' F R F'|PLL|vidurl=http://www.youtube.com/watch?v=-RKtMhtrd3Y}}
{{Alg|R' U' R F2 R' U R d R2 U' R2' U' R2|PLL}}
{{Alg|R2 U' R2 U' R2 d R U R' B2 R U' R'|PLL}}
{{Alg|(y') R2 u R2' U R2 D' R' U' R F2' R' U R|PLL}}
{{Alg|F R' F R2 U' R' U' R U R' F' R U R' U' F'|PLL}}
{{Alg|F R' F' R U R U' R2 U' R U l U' R' U F (x)|PLL}}
{{Alg|F R U' R' U' R d R U R' B' R U' R2|PLL}}
{{Alg|R' F R F' (y') U' R' U R2 U R' U' R' F R F' U'|PLL}}
{{Alg|(y) F' L' U L U L' U' L F L' U' L U L F' L' F|PLL}}
{{Alg|(y z) U2 R U R' U' R (y) R U L' U L U R' U' (x)|PLL}}
{{Alg|(z') U2 L' U' L U L' (y') L' U' R U' R' U' L U (x)|PLL}}
{{Alg|(y2 z) U2 R' U2 R' U2 R B R B' U2 B R' B' (z')|PLL}}
{{Alg|R2 U' R' U R U' (z' y') L' U' R U' R' U' L U (y z)|PLL}}
{{Alg|F R U' R' F D R' (y x) R' U' R (z) R2 (y) L' d2 (z)|PLL}}
{{Alg|(y2 z) U' R' U2 R' D R2 U' R U R2 U' D' R U' R U (z')|PLL}}
{{Alg|F R' F R2 U' R' U' R U R' F' R U R' U' F'|PLL}}
{{Alg|r U r' U' r U' r' y' l U' R2 U l' U' R2|PLL}}

 {{PLL}}

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

__NOTOC__

Talk:CLL algorithms (3x3x3)

2011-04-01T13:13:28Z

Kenneth:

Where are the CLL cases with just positioning corners (swapping adjacent or diagonal corners when all corners are already oriented)? PLL algs could be used but there may be more efficient algs than don't preserve edge orientation. I think these should be included here.
Edit: Following from this, I can confirm that the optimal CLL alg for permuting diagonal corners is better than any of the PLL's. I use RU'R'd'L2D'RB'R'DL2. I'd like to add sections for these cases but I'm not sure what name they should be given or how to create and upload the images for the cases. Could someone please add add these cases. Thanks.

: Hi Peter =) Yes, and it is easy, the images are at the [[CxLL]] pages and I think there are good alg there too. I can fix it in some days. Atm I'm occupied in another task. But mabye you know how to handle the wikicode? (tables n' stuff) Then you can do it =) // [[User:Kenneth|Kenneth]] 09:12, 1 April 2011 (EDT)

Talk:CLL algorithms (3x3x3)

2011-04-01T13:12:14Z

Kenneth:

Where are the CLL cases with just positioning corners (swapping adjacent or diagonal corners when all corners are already oriented)? PLL algs could be used but there may be more efficient algs than don't preserve edge orientation. I think these should be included here.
Edit: Following from this, I can confirm that the optimal CLL alg for permuting diagonal corners is better than any of the PLL's. I use RU'R'd'L2D'RB'R'DL2. I'd like to add sections for these cases but I'm not sure what name they should be given or how to create and upload the images for the cases. Could someone please add add these cases. Thanks.

: Hi Peter =) Yes, and it is easy, the images are at the CxLL pages and I think there are good alg there too. I can fix it in some days. Atm I'm occupied in another task. But mabye you know how to handle the wikicode? (tables n' stuff) Then you can do it =) // [[User:Kenneth|Kenneth]] 09:12, 1 April 2011 (EDT)

COLL

2011-03-21T13:17:04Z

Kenneth: /* See Also */

{{Method Infobox
|name=COLL
|image=OLLCP.png
|proposers=[[Lars Petrus]]
|variants=[[CLLEF]],[[OLLCP]]
|anames=Steps 5+6 ([[Petrus method]])
|year=
|steps=1
|algs=42
|moves=9.78 (Optimal [[HTM]])
|purpose=
* [[Speedsolving]]
}}

'''COLL''' (an abbreviation for '''Corners of Last Layer''') is a method in the [[CxLL]] group that solves the [[Last Layer]] [[corner]]s in one [[algorithm]], while preserving the [[F2L]] and the orientation of the LL [[edge]]s. So, after the COLL step, only edge permutation ([[EPLL]]) is left. COLL requires learning 40 algorithms (42 if you include T-Perm and Y-Perm and 24 if you exclude mirrors).

COLL is not to be confused with [[CLL]], which is an abbreviation for exactly the same name. The difference is that CLL preserves the F2L but not the last layer edges orientation, so it leaves the LL edges scrambled and the next step would be full [[ELL]]. For some cases the CLL and the COLL are the same algorithm, but for other cases the CLL is much shorter. For CLL and COLL algorithms, see the page on [[CxLL Algorithms]].

One possible extension of COLL is [[ZBLL]]. This LL method solves the entire LL if the edges are already oriented, but it has almost 500 cases. Another one is [[OLLCP]] which solves the corner permutation and [[OLL|orients the last layer]] with a total of over 300 algorithms for all last layer cases.

==See Also==
* [[CxLL Algorithms]]
* [http://www.speedsolving.com/wiki/index.php/Special:AlgDB?mode=view&view=default&puzzle=3&group=COLL&moves=FU2B%27UF%27U%27BU%27FU%27F%27 COLL Algorithms]
* [[CLLEF]]
* [[CLL]], [[CLL algorithms (3x3x3)]]
* [[CMLL]]
* [[ZBLL]]
* [[OLLCP]]

== External Links ==
* [http://www.cubezone.be/coll.html COLL Algorithms] By Lars Vandenbergh
* [http://www.stanford.edu/~leyanlo/ COLL Algorithms] By Leyan Lo
* [http://www.cubewhiz.com/coll.html Bob Burton's COLL Page]
* [http://jmbaum.110mb.com/coll.htm Jason Baum's COLL Page]
* [http://www.cubestation.co.uk/cs2/index.php?page=3x3x3/vh/coll/coll Dan Harris's COLL Page]
* [http://cube.danrcohen.com/coll.html Dan Cohen's COLL Page]

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

LPELL

2011-03-21T08:01:48Z

Kenneth: /* L RB */

{{Method Infobox
|name=LPELL
|image=LPELLinfo.png
|proposers=[[Kenneth Gustavsson]]
|year=2011
|anames=
|variants=[[ZBF2L]], [[VHF2L]]
|steps=2 or 1.5
|algs=2x6 or 2x48
|moves=? [[HTM]]
|purpose=[[FMC]], [[Speedsolving]]
}}
'''Last pair and edges of the last layer''' is a [[method]] that solves the last [[F2L|F2L pair]] and all edges of the last layer.

===Intermediate:===
This is diveded into two [[sub step]]s:
* '''LPEOLL''', orient all edges and pair up (any order). This is a intuitive step. Using algorithms is possible but you would need the same number as for [[ZBF2L]].
* '''LPEPLL''', place the last pair and permute all edges, that are six cases and their mirrors.

LPELL is mabye not so useful for [[speedsolving]] but for [[FMC]], after the step is done you will have [[L4C]] left, 1:3 times it will be only [[L3C]] and 1:324 you will have a compleate LL-skip. All L4C cases are easy to solve using one or two [[commutator]]s. In FMC, to save moves the commutators are preferably [[insert]]ed in the [[skeleton]] if such a point is found.

''Optimal algs for the second step are found lower at this page.''

===Advanced:===
A second way to solve this step is to first pair up and then do the rest in one look. There are 48 + 48 mirror cases for the second half. An advanced method that, if you include L4C places the last pair and solve all of the last layer in two looks and 'only' 180 algs. Recognition for the edges is awful if you just look at it, but is not harder than COLL or something, if you use sticker colour recognition.

''The cases are not listed on the internet, some day you may find them here...''
===Mad:===
*All in one?
*Forget it! There are thousands of cases. (six times ZBF2L)

=LPEPLL Cases=
{{Algnote}}
The names for the cases are where two of the edges will go, if it is a R side case, then these are first the edge sitting in UL and then the one in UB. For the L side cases these are UR and UB. The images assumes the UF edge is solved if the pair is above the slot, if it is some diffrent edge than UF, then just [[AUF]] it to solved position for recognition. Some algs may need a leading AUF if you are in the same position as the image, these are not explicity written here (the animations shows the correct position).

The average number of moves is 6 [[HTM]] not including any leading or ending AUF. All cases are having the same probability (1:2 R or L and 1:6 within these groups). The algs here are all optimal, if there are more than one for a case, then the other(s) does some diffrent LL-corner case than the first one.
==R side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== R LB ===
{{case
|image=LPELL_RLB.jpg
|name=R LB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=All solved here, but just placing the pair will swap two edges, that are optimally solved by sneaking in a backside Amtisune.}}
{{Alg|R U' R2 U2 R U R' U R}}
{{Alg|D R' U R' U' R' U R2 D'}}
{{Alg|F2 L' U' L U F2 R U' R'}}

| width="50%" |

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

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

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

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

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

==L side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== L RB ===
{{case
|image=LPELL_LRB.jpg
|name=L RB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=Mirror of R LB.}}
{{Alg|L' U L2 U2 L' U' L U' L'}}
{{Alg|D' L U' L U L U' L2 D}}
{{Alg|F2 R U R' U' F2 L' U L}}

| width="50%" |

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

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

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

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

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

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

__NOTOC__

LPELL

2011-03-21T07:59:52Z

Kenneth: /* R LB */

{{Method Infobox
|name=LPELL
|image=LPELLinfo.png
|proposers=[[Kenneth Gustavsson]]
|year=2011
|anames=
|variants=[[ZBF2L]], [[VHF2L]]
|steps=2 or 1.5
|algs=2x6 or 2x48
|moves=? [[HTM]]
|purpose=[[FMC]], [[Speedsolving]]
}}
'''Last pair and edges of the last layer''' is a [[method]] that solves the last [[F2L|F2L pair]] and all edges of the last layer.

===Intermediate:===
This is diveded into two [[sub step]]s:
* '''LPEOLL''', orient all edges and pair up (any order). This is a intuitive step. Using algorithms is possible but you would need the same number as for [[ZBF2L]].
* '''LPEPLL''', place the last pair and permute all edges, that are six cases and their mirrors.

LPELL is mabye not so useful for [[speedsolving]] but for [[FMC]], after the step is done you will have [[L4C]] left, 1:3 times it will be only [[L3C]] and 1:324 you will have a compleate LL-skip. All L4C cases are easy to solve using one or two [[commutator]]s. In FMC, to save moves the commutators are preferably [[insert]]ed in the [[skeleton]] if such a point is found.

''Optimal algs for the second step are found lower at this page.''

===Advanced:===
A second way to solve this step is to first pair up and then do the rest in one look. There are 48 + 48 mirror cases for the second half. An advanced method that, if you include L4C places the last pair and solve all of the last layer in two looks and 'only' 180 algs. Recognition for the edges is awful if you just look at it, but is not harder than COLL or something, if you use sticker colour recognition.

''The cases are not listed on the internet, some day you may find them here...''
===Mad:===
*All in one?
*Forget it! There are thousands of cases. (six times ZBF2L)

=LPEPLL Cases=
{{Algnote}}
The names for the cases are where two of the edges will go, if it is a R side case, then these are first the edge sitting in UL and then the one in UB. For the L side cases these are UR and UB. The images assumes the UF edge is solved if the pair is above the slot, if it is some diffrent edge than UF, then just [[AUF]] it to solved position for recognition. Some algs may need a leading AUF if you are in the same position as the image, these are not explicity written here (the animations shows the correct position).

The average number of moves is 6 [[HTM]] not including any leading or ending AUF. All cases are having the same probability (1:2 R or L and 1:6 within these groups). The algs here are all optimal, if there are more than one for a case, then the other(s) does some diffrent LL-corner case than the first one.
==R side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== R LB ===
{{case
|image=LPELL_RLB.jpg
|name=R LB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=All solved here, but just placing the pair will swap two edges, that are optimally solved by sneaking in a backside Amtisune.}}
{{Alg|R U' R2 U2 R U R' U R}}
{{Alg|D R' U R' U' R' U R2 D'}}
{{Alg|F2 L' U' L U F2 R U' R'}}

| width="50%" |

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

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

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

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

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

==L side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== L RB ===
{{case
|image=LPELL_LRB.jpg
|name=L RB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=Mirror of R LB.}}
{{Alg|L' U L2 U2 L' U' L U' L'}}
{{Alg|D' L U' L U L U' L2 D}}
| width="50%" |

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

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

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

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

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

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

__NOTOC__

Category:Fewest Moves techniques

2011-03-18T07:34:58Z

Kenneth: /* Pair Insertion */

This page introduces some tips and techniques to help you solve the cube in as [[Fewest Moves|few moves]] as possible.

The best results can be obtained when all techniques are controlled. It is strongly advised not to follow a strict pattern, for example a [[3x3x3 Speedsolving Methods|speedsolving method]]. However some algorithms learned from a speedsolving method will give some advantages in some cases. The most useful [[Fewest Moves Methods|methods]] are [[Heise]], [[Petrus]], [[Fridrich]], [[Roux]] and [[ZBLL]].

== Block Building ==
Best start for an FMC is block building technique. Try to build a [[2x2x2 block]] then a [[2x2x3 block]]. After the 2x2x2 block you have 3 sides to extend it to a 2x2x3. Explore all of them. After the 2x2x3 block

== Pair Insertion ==
when [[insertion|inserting]] Fridrich-pairs in F2L don't get stuck with you speedcubing methods but try some alternatives and check each of them for

== Pseudoblocks or Pre-scramble-moves==
Like [[Heise Method]] you can build pseudo blocks, which are adjacent 1x2x2 blocks or c/e pairs that are not adjacent but need an extra turn to get those blocks at the right color-centre. Solving with pseudo blocks needs can be very difficult and needs a lot of experience. As an alternative you can replace a pseudo block by a pre-scramble-move to give more oversight over your solve.

A pre-scramble move is a move you apply before the scramble and which allows you to find more possible solutions. Of course you must not forget to add the premove at the end of your solution.

== Inserted Moves (single) ==
Sometimes after a promising start you can't find a good continuation. Say you have solved a 2x2x2 block, but after that there's nothing good. By stepping through the solution you might see that at one place there's no 2x2x2-pieces on U, at that place you can try to insert U, U' or U2 and see if a better continuation is possible.

== Inserted Algorithms/Commutators ==
A very powerful technique in FMC is to solve everything except 3-5 corners and then insert 8 move [[commutators]] that cycle three corners earlier in the solution. Since there many corner configurations that can be solved in 8 moves often one will cancel moves, and thus one corner cycle will add less than 8 moves to the total solution length. Edge cycles are not used as oftenas FMC is judged in [[HTM]] and edge cycles often involve slice moves that are counted as two moves. Some people use stickers to more easily track the unsolved pieces through the solution.

== Freestyle Solving ==
If you see some opportunity to solve a lot of blocks without any (known) pattern you could try to solve it. When leaving a maximum of 4 edges and 4 corners try to conjugate them to 1 face during a solve. Then use pre-scramble-moves or a second cube to solve that face / LL

== LL-algorithms ==
sometimes you solve a lot of LL blocks using a very short LL algorithm, 8 or 9 moves maximum. Try to learn short LL algorithms in such a way that you know what it does to corners and edges. Start with the length-6 LL-alg, then the three 7-move LL-algs, the five 8-move LL-algs, and so on. You are really an expert when learning all LL-algs up to 10 moves.

A step up from this is to start the alg part from the [[last slot]], [[LPELL]] is one such method.

== Other Tips ==

* Do not use moves that turn the cube!

* Use fixed colors for up & front to enhance recognition!

* Better still, look at the centre of the face you are turning, it tells wich side it is ("White" = U and so on), then orientation does not matter anymore.

* Write down promising moves, do not wait till the very end!

* Create a backup solve!

* Learn to scramble fast, it can save a lot of time during a 1-hour solve.

* Bring stickers (for insertions) and extra cubes during a competition.

== See Also ==

* [[Fewest Moves]]
* [[Commutators]]
* [[Niklas]]
* [[God's Algorithm]]
* [[Fewest Moves Methods]]
* [[Puzzle Theory]]

== External Links ==

* [http://www.ryanheise.com/cube/fundamental_techniques.html Ryan Heise's page on intuitive solving techniques]
* Speedsolving.com [http://www.speedsolving.com/forum/showthread.php?t=1566 Fewest Moves: Tips and Techniques]
* Speedsolving.com [http://www.speedsolving.com/forum/showthread.php?p=221756 The FMC thread]

[[Category:Fewest Moves Methods]]

{{Stub}}

__NOTOC__

Last Four Corners

2011-03-18T07:27:22Z

Kenneth:

{{Method Infobox
|name=Last Four Corners
|image=LLEF.png
|anames=L4C
|steps=1
|algs=84
|moves=11.73 (Optimal [[HTM]])
|purpose=
* [[Speedsolving]], [[FMC]], [[BLD]]
}}

'''Last four corners''', abbrevaited '''L4C''' (or 4LC), is a [[method]] that solves the [[last layer]] corners preserving all the rest, a sub group of [[ZBLL]] and [[ZZLL]]. L4C is and is not a method in the [[CxLL]] group, not becuse it has twice the number of cases as all the other methods of the group (42/84).

'''Usage:'''
* For a 2-look last layer this is preceeded with [[LLEF]] (ELL-CLL).
* [[FMC]], aspecially linear FMC to solve the last layer corners but also normal FMC where a block + edge [[skeleton]] leaves 4 corners in diffrent layers, that are setup to one side and solved using L4C (not so effective but as a last resort).
* [[BLD]], the sub group [[L3C]] is used by many freestylers and is also a part of the [[Beyer-Hardwick Method]]. E and X cases are double 2-cyles, that can solve 4 corners in one go if the case is represented in the scramble or if it is easy to setup.

'''See also:'''
* [[Last Three Corners]]
==External links==
* [http://emsee.110mb.com/Speedcubing/ZZLL/No%20parity.html Michal Hordecki's algorithms for the last 4 corners]

{{L4C}}
==2-look L4C==
It is possible to solve most L4C in two looks using 3-cycle [[commutator]]s (see [[L3C]]). The method is to use the first 3-cycle to solve one piece and at the same time move any placed but twisted corner out from position (to avoid the pure twists that uses long algs) and then follow it up with a second 3-cycle. This will solve all cases but the pure twists with 4 corners wrong, that you can solve in two looks using only the U-twist and puzzle orientations, the other pure cases, T and U use the U-twist, L and S; cycle the twisted corners using any 3-cycle and then the appropiate cycle to move them back.

Another way is to use COs that preserves edges but not corner permutation (see [[Corner Orientation#OCLL-EPP|OCLL-EPP]]) and then end the solve using [[CPLL]]. This will use lesser algs but more turns than the first approach.

=L4C Cases=
Because edges are solved at this point you cannot AUF as in [[CxLL]] so the number of cases is quadrupled, but because you cannot have parity that is reduced again by factor 2. The orientations are the usual seven [[CO]]s plus the solved case ([[CPLL]]). The permutations (with fix position orientations) that occure are permutation solved, A-PLL a and b from all four angles, the two possible ways of E-PLL and finally X-PLL (that is H-PLL + U2) giving a total of twelve possible permutations. This gives a total of 8 * 12 = 96 cases, but it is possible to reduce that a bit because of duplicates. The whole group is larger, corner orientations are for real 27 so you will have 27 * 12 = 324, so the chance of a skip is 1:324.
===Recognition:===
For recognition the same systems that are used for [[CxLL]] works fine. You can find the CxLLs separated into the diffrent groups of the listing of the cases at this page, the CxLLs that have corners correctly permuted you can find in the group with pure CO and also in the X-PLL group, the CxLLs with diagonal permutation are in the E-PLL group and the CxLLs with adjacent permutation are in the A-PLL group (L3C/L3C 1-twist).

==Algorithms==
{{Algnote}}

The first [[algorithm]] given for each case is the optimal solution in [[half turn metric]].

===Sub groups:===
*'''Pure CO'''; see [[Corner Orientation]] for the seven cases of pure orientation and algorithms to solve them.
*'''All corners oriented'''; use the [[CPLL]]s for this, cases are [[A-PLL]] (a and b), [[E-PLL]] and [[H-PLL]] (X-PLL).
*'''One corner solved'''; Last Three Corners, 16 cases that have both orientation and permutation, these you can find at the [[L3C|L3C page]].

=L3C 1=
'''One corner placed but twisted:''' 54 in the group, 18 are pure twists (see [[Corner Orientation|CO]] for the cases), 36 cases are having both orientation and permutation and of these 18 are mirror cases.

==Two corners twisted==
The names for the cases are first the actual orientation (U, T or L) followed by the orientation of the inverse case (the case you get if you apply the alg on a solved cube) and last is the direction for the permutation cycle (a or b).
----
{|border="0" width="100%" valign="top" cellpadding="3"

|-valign="top"
| bgcolor="f0f4f8" |
The following four cases are mirror + inverses of the first so you only need '1 alg' for all.
| bgcolor="f0f4f8" |
Mirror to the side and inverse in diagonal.

|-valign="top"
|
=== ULa ===
[[File:L4C 1CW Ua.jpg]]

{{Alg|R' F' L F R F' L F' R2 F L2 F' R2 F2}}

|

=== ULb ===
[[File:L4C 1CCW Ub.jpg]]

{{Alg|(y) L F R' F' L' F R' F L2 F' R2 F L2 F2}}

|-valign="top"
|

=== LUa ===
[[File:L4C 1CW Lb.jpg]]

{{Alg|(y) F2 L2 F' R2 F L2 F' R F' L F R F' L'}}

|

=== LUb ===
[[File:L4C 1CCW Lb.jpg]]

{{Alg|F2 R2 F L2 F' R2 F L' F R' F' L' F R}}

|-valign="top"
| bgcolor="f0f4f8" |
The following four cases are mirror + inverses of the first so you only need '1 alg' for all.
| bgcolor="f0f4f8" |
Mirror to the side and inverse in diagonal.

|-valign="top"
|
=== TLa ===
[[File:L4C 1CCW Ta.jpg]]

{{Alg|B' U B R2 B R2 U' R2 U B2 U' B R2}}

|

=== TLb ===
[[File:L4C 1CW Tb.jpg]]

{{Alg|(y) B U' B' L2 B' L2 U L2 U' B2 U B' L2}}

|-valign="top"
|

=== LTa ===
[[File:L4C 1CCW La.jpg]]

{{Alg|(y) L2 B U' B2 U L2 U' L2 B L2 B U B'}}

|

=== LTb ===
[[File:L4C 1CW La.jpg]]

{{Alg|R2 B' U B2 U' R2 U R2 B' R2 B' U' B}}

|-valign="top"
| bgcolor="f0f4f8" |
For the following cases mirror and inverse are the same.
| bgcolor="f0f4f8" |
Mirror/inverse to the side.

|-valign="top"
|

=== TTa ===
[[File:L4C 1CW Ta.jpg]]

{{Alg|(y) U F R B U2 B' U B U2 B2 R B R2 F'}}

|

=== TTb ===
[[File:L4C 1CCW Tb.jpg]]

{{Alg|U' F' L' B' U2 B U' B' U2 B2 L' B' L2 F}}

|-valign="top"
|

=== UUa ===
[[File:L4C 1CCW Ua.jpg]]

{{Alg|(y) R B L' B L' D2 L D2 B' L B2 R' B}}

|

=== UUb ===
[[File:L4C 1CW Ub.jpg]]

{{Alg|R B L' B L' D2 L D2 B' L B2 R' B}}

|}

==Three corners twisted==
The names here are following the images, the first letter is the orientation, either Sune (S) or Antisune (-S), the second is the direction for the permutation cycle that is either a or b and in the parentesis is the location of the oriented corner that is one of three positions (BR, RF or FL).
----
{|border="0" width="100%" valign="top" cellpadding="3"

|-valign="top"
| bgcolor="f0f4f8" |
The following four cases are mirror + inverses of the first so you only need '1 alg' for all.
| bgcolor="f0f4f8" |
Mirror to the side and inverse in diagonal.

|-valign="top"
|

=== Sa (RF) ===
[[File:L4C 1CW S1a.jpg]]

{{Alg|U R2 D R' U2 R D' R' U L' U R' U' L}}

|

=== -Sb (RF) ===
[[File:L4C 1CCW S1b.jpg]]

{{Alg|(y) U' L2 D' L U2 L' D L U' R U' L U R'}}

|-valign="top"
|

=== Sa (BR) ===
[[File:L4C 1CW S3a.jpg]]

{{Alg|(y) R U' L' U R' U L' D' L U2 L' D L2 U}}

|

=== -Sb (FL) ===
[[File:L4C 1CCW S3b.jpg]]

{{Alg|L' U R U' L U' R D R' U2 R D' R2 U'}}

|-valign="top"
| bgcolor="f0f4f8" |
The following four cases are mirror + inverses of the first so you only need '1 alg' for all.
| bgcolor="f0f4f8" |
Mirror to the side and inverse in diagonal.

|-valign="top"
|

=== -Sa (BR) ===
[[File:L4C 1CCW S3a.jpg]]

{{Alg|R L B R' F R B' R2 F' L' F R F'}}

|

=== Sb (FL) ===
[[File:L4C 1CW S3b.jpg]]

{{Alg|(y) L' R' B' L F' L' B L2 F R F' L' F}}

|-valign="top"
|

=== -Sa (RF) ===
[[File:L4C 1CCW S2a.jpg]]

{{Alg|(y) F' L F R' F' L2 B' L F L' B R L}}

|

=== Sb (RF) ===
[[File:L4C 1CW S2b.jpg]]

{{Alg|F R' F' L F R2 B R' F' R B' L' R'}}

|-valign="top"
| bgcolor="f0f4f8" |
For the following cases mirror and inverse are the same.
| bgcolor="f0f4f8" |
Mirror/inverse to the side.

|-valign="top"
|

=== Sa (FL) ===
[[File:L4C 1CW S2a.jpg]]

{{Alg|R U' L' U2 R2 U' R' U' L U F2 R2 F2}}

|

=== -Sb (BR) ===
[[File:L4C 1CCW S2b.jpg]]

{{Alg|(y) L' U R U2 L2 U L U R' U' F2 L2 F2}}

|-valign="top"
|
=== -Sa (FL) ===
[[File:L4C 1CCW S1a.jpg]]

{{Alg|U2 R U2 R' F U2 F L' F' U2 F L F2}}

|

=== Sb (BR) ===
[[File:L4C 1CW S1b.jpg]]

{{Alg|(y) U2 L' U2 L F' U2 F' R F U2 F' R' F2}}

|}

==Four corners twisted==
The names for the cases are first orientation (H or pi) followed by the direction for the permutation cycle (a or b). In the parentesis is the orientation for the placed corner (+ or -) and for the pi cases also if this corner is on the U or the T side of the pi (For H it is only one situation).
----
{|border="0" width="100%" valign="top" cellpadding="3"

|-valign="top"
| bgcolor="f0f4f8" |
The following four cases are mirror + inverses of the first so you only need '1 alg' for all.
| bgcolor="f0f4f8" |
Mirror to the side and inverse in diagonal.

|-valign="top"
|

=== Ha (+) ===
[[File:L4C 1CW Ha.jpg]]

{{Alg|U2 R' F R F' U2 R2 B L' B L B2 R2}}

|

=== Hb (-) ===
[[File:L4C 1CCW Hb.jpg]]

{{Alg|(y) U2 L F' L' F U2 L2 B' R B' R' B2 L2}}

|-valign="top"
|

=== pia (T+) ===
[[File:L4C 1CW pi2a.jpg]]

{{Alg|(y) L2 B2 R B R' B L2 U2 F' L F L' U2}}

|

=== pib (T-) ===
[[File:L4C 1CCW pi2b.jpg]]

{{Alg|R2 B2 L' B' L B' R2 U2 F R' F' R U2}}

|-valign="top"
| bgcolor="f0f4f8" |
The following four cases are mirror + inverses of the first so you only need '1 alg' for all.
| bgcolor="f0f4f8" |
Mirror to the side and inverse in diagonal.

|-valign="top"
|

=== Ha (-) ===
[[File:L4C 1CCW Ha.jpg]]

{{Alg|(y) F2 L U L2 F2 D F2 D' L F2 L U' L'}}

|

=== Hb (+) ===
[[File:L4C 1CW Hb.jpg]]

{{Alg|F2 R' U' R2 F2 D' F2 D R' F2 R' U R}}

|-valign="top"

|

=== pia (U-) ===
[[File:L4C 1CCW pi1a.jpg]]

{{Alg|R' U' R F2 R D' F2 D F2 R2 U R F2}}

|

=== pib (U+) ===
[[File:L4C 1CW pi1b.jpg]]

{{Alg|(y) L U L' F2 L' D F2 D' F2 L2 U' L' F2}}

|-valign="top"
| bgcolor="f0f4f8" |
For the following cases mirror and inverse are the same.
| bgcolor="f0f4f8" |
Mirror/inverse to the side.

|-valign="top"
|

=== pia (U+) ===
[[File:L4C 1CW pi1a.jpg]]

{{Alg|U2 F U2 F' U2 F' L F' R' F' R F' L'}}

|

=== pib (U-) ===
[[File:L4C 1CCW pi1b.jpg]]

{{Alg|L F R' F R F L' F U2 F U2 F' U2}}

|-valign="top"
|

=== pia (T-) ===
[[File:L4C 1CCW pi2a.jpg]]

{{Alg|R2 U R2 B' D R2 D' R2 B D' F2 D F2 U'}}

|

=== pib (T+) ===
[[File:L4C 1CW pi2b.jpg]]

{{Alg|U F2 D' F2 D B' R2 D R2 D' B R2 U' R2}}

|}

----

=Four corners wrong (E)=
16 cases, two are [[E-PLL]], leaving 14.

Some cases are order 2 and some are order 6 but in practice most works as 2-cycles if you add a y2. The rest of the order 6 cases may have a mirror or a inverse.
----
{|border="0" width="100%" valign="top" cellpadding="3"

|-valign="top"
| bgcolor="f0f4f8" |
'''Order 2'''
| bgcolor="f0f4f8" |
'''Order 6''', but adding y2 makes the inverse case the same as this, in practice a 2-cycle.

|-valign="top"
|
=== Uea ===
[[File:L4C UE (a).jpg]]

{{Alg|F R2 B2 D2 R U2 L' F2 D2 L U2 R F'}}

|

=== Ueb ===
[[File:L4C UE (b).jpg]]

{{Alg|R' F' U' F R B L F U F' L' B'}}
{{Alg|(y2) r' U' M' F' M U M' F R}}

|-valign="top"
| bgcolor="f0f4f8" |
'''Order 2'''
| bgcolor="f0f4f8" |
'''Order 6''', but adding y2 makes the inverse case the same as this, in practice a 2-cycle.

|-valign="top"
|

=== Tea ===
[[File:L4C TE (a).jpg]]

{{Alg|U R U' R2 F' L' F R2 U R' U' F' L F}}

|

=== Teb ===
[[File:L4C TE (b).jpg]]

{{Alg|R U' F' D2 F2 D' F' U' F D F2 D2 F U2 R'}}

|-valign="top"
|

|-valign="top"
| bgcolor="f0f4f8" |
For the following 3 * 2 cases mirror and inverse are the same.
| bgcolor="f0f4f8" |
Mirror/inverse to the side.

|-valign="top"
|

=== Lea ===
[[File:L4C LE (a).jpg]]

{{Alg|(y) F' U2 F2 R' F' R2 B L U2 L' B' R' U2}}

|

=== Leb ===
[[File:L4C LE (b).jpg]]

{{Alg|U2 R B L U2 L' B' R2 F R F2 U2 F}}

|-valign="top"
|

=== Sea ===
[[File:L4C SE (a).jpg]]

{{Alg|(y') L U2 B' R B R' U2 L' B' U2 B2 U2 B' }}

|

=== -Seb ===
[[File:L4C aSE (a).jpg]]

{{Alg|R' U2 B L' B' L U2 R B U2 B2 U2 B}}

|-valign="top"
|

=== -Sea ===
[[File:L4C aSE (b).jpg]]

{{Alg|R L B R' F R F' B' L' F R' F'}}

|
=== Seb ===
[[File:L4C SE (b).jpg]]

{{Alg|(y') F R F' L B F R' F' R B' L' R'}}
{{Alg|(y') R2 U' R2 U' R2 U2 L U L' U' R2 U2 L U2 L'}}

|-valign="top"
| bgcolor="f0f4f8" |
'''Order 2''' (triple FRURUF)
| bgcolor="f0f4f8" |
'''Order 2'''

|-valign="top"
|

=== Hea ===
[[File:L4C HE (a).jpg]]

{{Alg|R U2 R2 F2 L D2 R' D2 R2 F2 L' U2}}
{{Alg|F (R U R' U')3 F'}}
{{Alg|L U2 R2 F2 R U2 R' F2 R2 U2 l' U2 M}}

|

=== Heb ===
[[File:L4C HE (b).jpg]]

{{Alg|U2 F2 R D2 R' F2 U2 F2 L B2 L' F2}}
{{Alg|R U2 L D2 L' U2 R' L U2 R D2 R' U2 L'}}

|-valign="top"
| bgcolor="f0f4f8" |
'''Order 2'''
| bgcolor="f0f4f8" |
'''Order 6''', but adding y2 makes the inverse case the same as this, in practice a 2-cycle.

|-valign="top"
|

=== piea ===
[[File:L4C piE (b).jpg]]

{{Alg|U F U F2 R2 F2 U' F' U' L2 B' D2 B L2}}

|
=== pieb ===
[[File:L4C piE (a).jpg]]

{{Alg|U' R U' R2 D' R U2 R' U' F2 U F2 D R}}
{{Alg|U L' U L2 D L' U2 L U F2 U' F2 D' L'}}

|}

=Four corners wrong (X)=
8 to solve and one of these is [[X-PLL]], leaving 7, all solveable using only RU ([[2-gen]]).
----
{|border="0" width="100%" valign="top" cellpadding="3"

|-valign="top"
| bgcolor="f0f4f8" |
'''Tx''' is the inverse of '''Ux'''.
| bgcolor="f0f4f8" |
These can be solved with optimal movecount with 2 [[conjugate]]s (first alg in the lists).

|-valign="top"
|
=== Ux ===
[[File:L4C UX.jpg]]

{{Alg|(y2) R2 B2 R F R' B2 R2 B' R' F' R B}}
{{Alg|U2 R2 U' R2 U2 R U R' U R' U R' U R2 U2 R}}

|

=== Tx ===
[[File:L4C TX.jpg]]

{{Alg|(y2) F R B' R' F' R2 F2 R' B R F2 R2}}
{{Alg|U2 R' U2 R2 U' R U' R U' R U' R' U2 R2 U R2}}

|-valign="top"
| bgcolor="f0f4f8" |
'''Lx''' is self inverting and self mirroring, only one case here.
| bgcolor="f0f4f8" |
Any variation of triple Sune/anti/fat/mirror to solve fast (but not optimally).

|-valign="top"
|

=== Lx ===
[[File:L4C LX.jpg]]

{{Alg|L' U L2 F' L D' B L B' L2 D L' F U'}}
{{Alg|(y') R U R' U R U' R' U R U' R' U R U2 R'}}

|}

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

|-valign="top"
| bgcolor="f0f4f8" |
'''Sx''' and '''-Sx''' are mirror cases.
| bgcolor="f0f4f8" |
'Sune-Bruno' is the optimal alg.

|-valign="top"
|

=== Sx ===
[[File:L4C SX.jpg]]

{{Alg|U2 R' U' R U' R U R2 U R2 U2 R'}}

|

=== -Sx ===
[[File:L4C aSX.jpg]]

{{Alg|(y') R U R' U R' U' R2 U' R2 U2 R U2}}

|-valign="top"
|

=== Hx ===
[[File:L4C HX.jpg]]

{{Alg|(y) L2 R D' R' U B2 U B2 U' R D L2 R' U'}}
{{Alg|R U2 R2 U2 R' U R' U' R U2 R U R U' R' U}}

|

=== Pix ===
[[File:L4C piX.jpg]]

{{Alg|F' R D2 R' F U' F' R D2 R' F U}}
{{Alg|(y) R U2 R2 U' R' U R2 U' R' U' R' U2 R' U2 R}}
{{Alg|L U' R' U L' U' R2 U' L' U R' U' L U2}}

|
|}

----
 {{L4C}}

[[Category:Methods]]
[[Category:3x3x3 Methods]]
[[Category:Sub Steps]]
[[Category:Last Layer Methods]]
[[Category:Cubing Terminology]]

__NOTOC__

LPELL

2011-03-17T15:21:24Z

Kenneth: /* L RB */

{{Method Infobox
|name=LPELL
|image=LPELLinfo.png
|proposers=[[Kenneth Gustavsson]]
|year=2011
|anames=
|variants=[[ZBF2L]], [[VHF2L]]
|steps=2 or 1.5
|algs=2x6 or 2x48
|moves=? [[HTM]]
|purpose=[[FMC]], [[Speedsolving]]
}}
'''Last pair and edges of the last layer''' is a [[method]] that solves the last [[F2L|F2L pair]] and all edges of the last layer.

===Intermediate:===
This is diveded into two [[sub step]]s:
* '''LPEOLL''', orient all edges and pair up (any order). This is a intuitive step. Using algorithms is possible but you would need the same number as for [[ZBF2L]].
* '''LPEPLL''', place the last pair and permute all edges, that are six cases and their mirrors.

LPELL is mabye not so useful for [[speedsolving]] but for [[FMC]], after the step is done you will have [[L4C]] left, 1:3 times it will be only [[L3C]] and 1:324 you will have a compleate LL-skip. All L4C cases are easy to solve using one or two [[commutator]]s. In FMC, to save moves the commutators are preferably [[insert]]ed in the [[skeleton]] if such a point is found.

''Optimal algs for the second step are found lower at this page.''

===Advanced:===
A second way to solve this step is to first pair up and then do the rest in one look. There are 48 + 48 mirror cases for the second half. An advanced method that, if you include L4C places the last pair and solve all of the last layer in two looks and 'only' 180 algs. Recognition for the edges is awful if you just look at it, but is not harder than COLL or something, if you use sticker colour recognition.

''The cases are not listed on the internet, some day you may find them here...''
===Mad:===
*All in one?
*Forget it! There are thousands of cases. (six times ZBF2L)

=LPEPLL Cases=
{{Algnote}}
The names for the cases are where two of the edges will go, if it is a R side case, then these are first the edge sitting in UL and then the one in UB. For the L side cases these are UR and UB. The images assumes the UF edge is solved if the pair is above the slot, if it is some diffrent edge than UF, then just [[AUF]] it to solved position for recognition. Some algs may need a leading AUF if you are in the same position as the image, these are not explicity written here (the animations shows the correct position).

The average number of moves is 6 [[HTM]] not including any leading or ending AUF. All cases are having the same probability (1:2 R or L and 1:6 within these groups). The algs here are all optimal, if there are more than one for a case, then the other(s) does some diffrent LL-corner case than the first one.
==R side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== R LB ===
{{case
|image=LPELL_RLB.jpg
|name=R LB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=All solved here, but just placing the pair will swap two edges, that are optimally solved by sneaking in a backside Amtisune.}}
{{Alg|R U' R2 U2 R U R' U R}}
{{Alg|D R' U R' U' R' U R2 D'}}
| width="50%" |

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

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

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

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

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

==L side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== L RB ===
{{case
|image=LPELL_LRB.jpg
|name=L RB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=Mirror of R LB.}}
{{Alg|L' U L2 U2 L' U' L U' L'}}
{{Alg|D' L U' L U L U' L2 D}}
| width="50%" |

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

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

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

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

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

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

__NOTOC__

LPELL

2011-03-17T15:20:27Z

Kenneth: /* LPEPLL Cases */

{{Method Infobox
|name=LPELL
|image=LPELLinfo.png
|proposers=[[Kenneth Gustavsson]]
|year=2011
|anames=
|variants=[[ZBF2L]], [[VHF2L]]
|steps=2 or 1.5
|algs=2x6 or 2x48
|moves=? [[HTM]]
|purpose=[[FMC]], [[Speedsolving]]
}}
'''Last pair and edges of the last layer''' is a [[method]] that solves the last [[F2L|F2L pair]] and all edges of the last layer.

===Intermediate:===
This is diveded into two [[sub step]]s:
* '''LPEOLL''', orient all edges and pair up (any order). This is a intuitive step. Using algorithms is possible but you would need the same number as for [[ZBF2L]].
* '''LPEPLL''', place the last pair and permute all edges, that are six cases and their mirrors.

LPELL is mabye not so useful for [[speedsolving]] but for [[FMC]], after the step is done you will have [[L4C]] left, 1:3 times it will be only [[L3C]] and 1:324 you will have a compleate LL-skip. All L4C cases are easy to solve using one or two [[commutator]]s. In FMC, to save moves the commutators are preferably [[insert]]ed in the [[skeleton]] if such a point is found.

''Optimal algs for the second step are found lower at this page.''

===Advanced:===
A second way to solve this step is to first pair up and then do the rest in one look. There are 48 + 48 mirror cases for the second half. An advanced method that, if you include L4C places the last pair and solve all of the last layer in two looks and 'only' 180 algs. Recognition for the edges is awful if you just look at it, but is not harder than COLL or something, if you use sticker colour recognition.

''The cases are not listed on the internet, some day you may find them here...''
===Mad:===
*All in one?
*Forget it! There are thousands of cases. (six times ZBF2L)

=LPEPLL Cases=
{{Algnote}}
The names for the cases are where two of the edges will go, if it is a R side case, then these are first the edge sitting in UL and then the one in UB. For the L side cases these are UR and UB. The images assumes the UF edge is solved if the pair is above the slot, if it is some diffrent edge than UF, then just [[AUF]] it to solved position for recognition. Some algs may need a leading AUF if you are in the same position as the image, these are not explicity written here (the animations shows the correct position).

The average number of moves is 6 [[HTM]] not including any leading or ending AUF. All cases are having the same probability (1:2 R or L and 1:6 within these groups). The algs here are all optimal, if there are more than one for a case, then the other(s) does some diffrent LL-corner case than the first one.
==R side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== R LB ===
{{case
|image=LPELL_RLB.jpg
|name=R LB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=All solved here, but just placing the pair will swap two edges, that are optimally solved by sneaking in a backside Amtisune.}}
{{Alg|R U' R2 U2 R U R' U R}}
{{Alg|D R' U R' U' R' U R2 D'}}
| width="50%" |

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

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

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

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

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

==L side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== L RB ===
{{case
|image=LPELL_LRB.jpg
|name=L RB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=Mirror of R LB.}}
{{Alg|L' U L2 U2 L' U' L U' L'}}
| width="50%" |

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

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

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

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

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

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

__NOTOC__

LPELL

2011-03-17T15:16:50Z

Kenneth: /* R LB */

{{Method Infobox
|name=LPELL
|image=LPELLinfo.png
|proposers=[[Kenneth Gustavsson]]
|year=2011
|anames=
|variants=[[ZBF2L]], [[VHF2L]]
|steps=2 or 1.5
|algs=2x6 or 2x48
|moves=? [[HTM]]
|purpose=[[FMC]], [[Speedsolving]]
}}
'''Last pair and edges of the last layer''' is a [[method]] that solves the last [[F2L|F2L pair]] and all edges of the last layer.

===Intermediate:===
This is diveded into two [[sub step]]s:
* '''LPEOLL''', orient all edges and pair up (any order). This is a intuitive step. Using algorithms is possible but you would need the same number as for [[ZBF2L]].
* '''LPEPLL''', place the last pair and permute all edges, that are six cases and their mirrors.

LPELL is mabye not so useful for [[speedsolving]] but for [[FMC]], after the step is done you will have [[L4C]] left, 1:3 times it will be only [[L3C]] and 1:324 you will have a compleate LL-skip. All L4C cases are easy to solve using one or two [[commutator]]s. In FMC, to save moves the commutators are preferably [[insert]]ed in the [[skeleton]] if such a point is found.

''Optimal algs for the second step are found lower at this page.''

===Advanced:===
A second way to solve this step is to first pair up and then do the rest in one look. There are 48 + 48 mirror cases for the second half. An advanced method that, if you include L4C places the last pair and solve all of the last layer in two looks and 'only' 180 algs. Recognition for the edges is awful if you just look at it, but is not harder than COLL or something, if you use sticker colour recognition.

''The cases are not listed on the internet, some day you may find them here...''
===Mad:===
*All in one?
*Forget it! There are thousands of cases. (six times ZBF2L)

=LPEPLL Cases=
{{Algnote}}
The names for the cases are where two of the edges will go, if it is a R side case, then these are first the edge sitting in UL and then the one in UB. For the L side cases these are UR and UB. The images assumes the UF edge is solved if the pair is above the slot, if it is some diffrent edge than UF, then just [[AUF]] it to solved position for recognition. Some algs may need a leading AUF if you are in the same position as the image, these are not explicity written here (the animations shows the correct position).

The average number of moves is 6 [[HTM]] not including any leading or ending AUF. All cases are having the same probability (1:2 R or L and 1:6 within these groups).
==R side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== R LB ===
{{case
|image=LPELL_RLB.jpg
|name=R LB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=All solved here, but just placing the pair will swap two edges, that are optimally solved by sneaking in a backside Amtisune.}}
{{Alg|R U' R2 U2 R U R' U R}}
{{Alg|D R' U R' U' R' U R2 D'}}
| width="50%" |

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

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

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

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

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

==L side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== L RB ===
{{case
|image=LPELL_LRB.jpg
|name=L RB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=Mirror of R LB.}}
{{Alg|L' U L2 U2 L' U' L U' L'}}
| width="50%" |

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

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

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

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

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

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

__NOTOC__

LPELL

2011-03-17T11:05:08Z

Kenneth: /* LPEPLL Cases */

{{Method Infobox
|name=LPELL
|image=LPELLinfo.png
|proposers=[[Kenneth Gustavsson]]
|year=2011
|anames=
|variants=[[ZBF2L]], [[VHF2L]]
|steps=2 or 1.5
|algs=2x6 or 2x48
|moves=? [[HTM]]
|purpose=[[FMC]], [[Speedsolving]]
}}
'''Last pair and edges of the last layer''' is a [[method]] that solves the last [[F2L|F2L pair]] and all edges of the last layer.

===Intermediate:===
This is diveded into two [[sub step]]s:
* '''LPEOLL''', orient all edges and pair up (any order). This is a intuitive step. Using algorithms is possible but you would need the same number as for [[ZBF2L]].
* '''LPEPLL''', place the last pair and permute all edges, that are six cases and their mirrors.

LPELL is mabye not so useful for [[speedsolving]] but for [[FMC]], after the step is done you will have [[L4C]] left, 1:3 times it will be only [[L3C]] and 1:324 you will have a compleate LL-skip. All L4C cases are easy to solve using one or two [[commutator]]s. In FMC, to save moves the commutators are preferably [[insert]]ed in the [[skeleton]] if such a point is found.

''Optimal algs for the second step are found lower at this page.''

===Advanced:===
A second way to solve this step is to first pair up and then do the rest in one look. There are 48 + 48 mirror cases for the second half. An advanced method that, if you include L4C places the last pair and solve all of the last layer in two looks and 'only' 180 algs. Recognition for the edges is awful if you just look at it, but is not harder than COLL or something, if you use sticker colour recognition.

''The cases are not listed on the internet, some day you may find them here...''
===Mad:===
*All in one?
*Forget it! There are thousands of cases. (six times ZBF2L)

=LPEPLL Cases=
{{Algnote}}
The names for the cases are where two of the edges will go, if it is a R side case, then these are first the edge sitting in UL and then the one in UB. For the L side cases these are UR and UB. The images assumes the UF edge is solved if the pair is above the slot, if it is some diffrent edge than UF, then just [[AUF]] it to solved position for recognition. Some algs may need a leading AUF if you are in the same position as the image, these are not explicity written here (the animations shows the correct position).

The average number of moves is 6 [[HTM]] not including any leading or ending AUF. All cases are having the same probability (1:2 R or L and 1:6 within these groups).
==R side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== R LB ===
{{case
|image=LPELL_RLB.jpg
|name=R LB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=All solved here, but just placing the pair will swap two edges, that are optimally solved by sneaking in a backside Amtisune.}}
{{Alg|R U' R2 U2 R U R' U R}}
| width="50%" |

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

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

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

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

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

==L side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== L RB ===
{{case
|image=LPELL_LRB.jpg
|name=L RB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=Mirror of R LB.}}
{{Alg|L' U L2 U2 L' U' L U' L'}}
| width="50%" |

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

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

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

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

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

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

__NOTOC__

LPELL

2011-03-17T11:04:08Z

Kenneth: /* LPEPLL Cases */

{{Method Infobox
|name=LPELL
|image=LPELLinfo.png
|proposers=[[Kenneth Gustavsson]]
|year=2011
|anames=
|variants=[[ZBF2L]], [[VHF2L]]
|steps=2 or 1.5
|algs=2x6 or 2x48
|moves=? [[HTM]]
|purpose=[[FMC]], [[Speedsolving]]
}}
'''Last pair and edges of the last layer''' is a [[method]] that solves the last [[F2L|F2L pair]] and all edges of the last layer.

===Intermediate:===
This is diveded into two [[sub step]]s:
* '''LPEOLL''', orient all edges and pair up (any order). This is a intuitive step. Using algorithms is possible but you would need the same number as for [[ZBF2L]].
* '''LPEPLL''', place the last pair and permute all edges, that are six cases and their mirrors.

LPELL is mabye not so useful for [[speedsolving]] but for [[FMC]], after the step is done you will have [[L4C]] left, 1:3 times it will be only [[L3C]] and 1:324 you will have a compleate LL-skip. All L4C cases are easy to solve using one or two [[commutator]]s. In FMC, to save moves the commutators are preferably [[insert]]ed in the [[skeleton]] if such a point is found.

''Optimal algs for the second step are found lower at this page.''

===Advanced:===
A second way to solve this step is to first pair up and then do the rest in one look. There are 48 + 48 mirror cases for the second half. An advanced method that, if you include L4C places the last pair and solve all of the last layer in two looks and 'only' 180 algs. Recognition for the edges is awful if you just look at it, but is not harder than COLL or something, if you use sticker colour recognition.

''The cases are not listed on the internet, some day you may find them here...''
===Mad:===
*All in one?
*Forget it! There are thousands of cases. (six times ZBF2L)

=LPEPLL Cases=
{{Algnote}}
The names for the cases are where two of the edges will go, if it is a R side case, then these are first the edge sitting in UL and then the one in UB. For the L side cases these are UR and UB. 
The images assumes the UF edge is solved if the pair is above the slot, if it is some diffrent edge than UF, then just [[AUF]] it to solved position for recognition. 
Some algs may need a leading AUF if you are in the same position as the image, these are not explicity written here (the animations shows the correct position). 

The average number of moves is 6 [[HTM]] not including any leading or ending AUF. All cases are having the same probability (1:2 R or L and 1:6 within these groups).
==R side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== R LB ===
{{case
|image=LPELL_RLB.jpg
|name=R LB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=All solved here, but just placing the pair will swap two edges, that are optimally solved by sneaking in a backside Amtisune.}}
{{Alg|R U' R2 U2 R U R' U R}}
| width="50%" |

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

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

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

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

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

==L side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== L RB ===
{{case
|image=LPELL_LRB.jpg
|name=L RB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=Mirror of R LB.}}
{{Alg|L' U L2 U2 L' U' L U' L'}}
| width="50%" |

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

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

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

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

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

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

__NOTOC__

LPELL

2011-03-17T11:02:18Z

Kenneth: /* LPEPLL Cases */

{{Method Infobox
|name=LPELL
|image=LPELLinfo.png
|proposers=[[Kenneth Gustavsson]]
|year=2011
|anames=
|variants=[[ZBF2L]], [[VHF2L]]
|steps=2 or 1.5
|algs=2x6 or 2x48
|moves=? [[HTM]]
|purpose=[[FMC]], [[Speedsolving]]
}}
'''Last pair and edges of the last layer''' is a [[method]] that solves the last [[F2L|F2L pair]] and all edges of the last layer.

===Intermediate:===
This is diveded into two [[sub step]]s:
* '''LPEOLL''', orient all edges and pair up (any order). This is a intuitive step. Using algorithms is possible but you would need the same number as for [[ZBF2L]].
* '''LPEPLL''', place the last pair and permute all edges, that are six cases and their mirrors.

LPELL is mabye not so useful for [[speedsolving]] but for [[FMC]], after the step is done you will have [[L4C]] left, 1:3 times it will be only [[L3C]] and 1:324 you will have a compleate LL-skip. All L4C cases are easy to solve using one or two [[commutator]]s. In FMC, to save moves the commutators are preferably [[insert]]ed in the [[skeleton]] if such a point is found.

''Optimal algs for the second step are found lower at this page.''

===Advanced:===
A second way to solve this step is to first pair up and then do the rest in one look. There are 48 + 48 mirror cases for the second half. An advanced method that, if you include L4C places the last pair and solve all of the last layer in two looks and 'only' 180 algs. Recognition for the edges is awful if you just look at it, but is not harder than COLL or something, if you use sticker colour recognition.

''The cases are not listed on the internet, some day you may find them here...''
===Mad:===
*All in one?
*Forget it! There are thousands of cases. (six times ZBF2L)

=LPEPLL Cases=
{{Algnote}}
The images assumes the UF edge is solved if the pair is above the slot, if it is some diffrent edge than UF, then just [[AUF]] it to solved position for recognition. 
Some algs may need a leading AUF if you are in the same position as the image, these are not explicity written here (the animations shows the correct position). 
The names for the cases are where two of the edges will go, if it is a R side case, then these are first the edge sitting in UL and then the one in UB. For the L side cases these are UR and UB.

The average number of moves is 6 [[HTM]] not including any leading or ending AUF. All cases are having the same probability (1:2 R or L and 1:6 within these groups).
==R side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== R LB ===
{{case
|image=LPELL_RLB.jpg
|name=R LB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=All solved here, but just placing the pair will swap two edges, that are optimally solved by sneaking in a backside Amtisune.}}
{{Alg|R U' R2 U2 R U R' U R}}
| width="50%" |

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

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

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

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

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

==L side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== L RB ===
{{case
|image=LPELL_LRB.jpg
|name=L RB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=Mirror of R LB.}}
{{Alg|L' U L2 U2 L' U' L U' L'}}
| width="50%" |

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

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

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

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

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

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

__NOTOC__

Category:Fewest Moves techniques

2011-03-16T18:18:36Z

Kenneth: /* LL-algorithms */

This page introduces some tips and techniques to help you solve the cube in as [[Fewest Moves|few moves]] as possible.

The best results can be obtained when all techniques are controlled. It is strongly advised not to follow a strict pattern, for example a [[3x3x3 Speedsolving Methods|speedsolving method]]. However some algorithms learned from a speedsolving method will give some advantages in some cases. The most useful [[Fewest Moves Methods|methods]] are [[Heise]], [[Petrus]], [[Fridrich]], [[Roux]] and [[ZBLL]].

== Block Building ==
Best start for an FMC is block building technique. Try to build a [[2x2x2 block]] then a [[2x2x3 block]]. After the 2x2x2 block you have 3 sides to extend it to a 2x2x3. Explore all of them. After the 2x2x3 block

== Pair Insertion ==
when inserting Fridrich-pairs in F2L don't get stuck with you speedcubing methods but try some alternatives and check each of them for

== Pseudoblocks or Pre-scramble-moves==
Like [[Heise Method]] you can build pseudo blocks, which are adjacent 1x2x2 blocks or c/e pairs that are not adjacent but need an extra turn to get those blocks at the right color-centre. Solving with pseudo blocks needs can be very difficult and needs a lot of experience. As an alternative you can replace a pseudo block by a pre-scramble-move to give more oversight over your solve.

A pre-scramble move is a move you apply before the scramble and which allows you to find more possible solutions. Of course you must not forget to add the premove at the end of your solution.

== Inserted Moves (single) ==
Sometimes after a promising start you can't find a good continuation. Say you have solved a 2x2x2 block, but after that there's nothing good. By stepping through the solution you might see that at one place there's no 2x2x2-pieces on U, at that place you can try to insert U, U' or U2 and see if a better continuation is possible.

== Inserted Algorithms/Commutators ==
A very powerful technique in FMC is to solve everything except 3-5 corners and then insert 8 move [[commutators]] that cycle three corners earlier in the solution. Since there many corner configurations that can be solved in 8 moves often one will cancel moves, and thus one corner cycle will add less than 8 moves to the total solution length. Edge cycles are not used as oftenas FMC is judged in [[HTM]] and edge cycles often involve slice moves that are counted as two moves. Some people use stickers to more easily track the unsolved pieces through the solution.

== Freestyle Solving ==
If you see some opportunity to solve a lot of blocks without any (known) pattern you could try to solve it. When leaving a maximum of 4 edges and 4 corners try to conjugate them to 1 face during a solve. Then use pre-scramble-moves or a second cube to solve that face / LL

== LL-algorithms ==
sometimes you solve a lot of LL blocks using a very short LL algorithm, 8 or 9 moves maximum. Try to learn short LL algorithms in such a way that you know what it does to corners and edges. Start with the length-6 LL-alg, then the three 7-move LL-algs, the five 8-move LL-algs, and so on. You are really an expert when learning all LL-algs up to 10 moves.

A step up from this is to start the alg part from the [[last slot]], [[LPELL]] is one such method.

== Other Tips ==

* Do not use moves that turn the cube!

* Use fixed colors for up & front to enhance recognition!

* Better still, look at the centre of the face you are turning, it tells wich side it is ("White" = U and so on), then orientation does not matter anymore.

* Write down promising moves, do not wait till the very end!

* Create a backup solve!

* Learn to scramble fast, it can save a lot of time during a 1-hour solve.

* Bring stickers (for insertions) and extra cubes during a competition.

== See Also ==

* [[Fewest Moves]]
* [[Commutators]]
* [[Niklas]]
* [[God's Algorithm]]
* [[Fewest Moves Methods]]
* [[Puzzle Theory]]

== External Links ==

* [http://www.ryanheise.com/cube/fundamental_techniques.html Ryan Heise's page on intuitive solving techniques]
* Speedsolving.com [http://www.speedsolving.com/forum/showthread.php?t=1566 Fewest Moves: Tips and Techniques]
* Speedsolving.com [http://www.speedsolving.com/forum/showthread.php?p=221756 The FMC thread]

[[Category:Fewest Moves Methods]]

{{Stub}}

__NOTOC__

LPELL

2011-03-16T18:10:13Z

Kenneth:

{{Method Infobox
|name=LPELL
|image=LPELLinfo.png
|proposers=[[Kenneth Gustavsson]]
|year=2011
|anames=
|variants=[[ZBF2L]], [[VHF2L]]
|steps=2 or 1.5
|algs=2x6 or 2x48
|moves=? [[HTM]]
|purpose=[[FMC]], [[Speedsolving]]
}}
'''Last pair and edges of the last layer''' is a [[method]] that solves the last [[F2L|F2L pair]] and all edges of the last layer.

===Intermediate:===
This is diveded into two [[sub step]]s:
* '''LPEOLL''', orient all edges and pair up (any order). This is a intuitive step. Using algorithms is possible but you would need the same number as for [[ZBF2L]].
* '''LPEPLL''', place the last pair and permute all edges, that are six cases and their mirrors.

LPELL is mabye not so useful for [[speedsolving]] but for [[FMC]], after the step is done you will have [[L4C]] left, 1:3 times it will be only [[L3C]] and 1:324 you will have a compleate LL-skip. All L4C cases are easy to solve using one or two [[commutator]]s. In FMC, to save moves the commutators are preferably [[insert]]ed in the [[skeleton]] if such a point is found.

''Optimal algs for the second step are found lower at this page.''

===Advanced:===
A second way to solve this step is to first pair up and then do the rest in one look. There are 48 + 48 mirror cases for the second half. An advanced method that, if you include L4C places the last pair and solve all of the last layer in two looks and 'only' 180 algs. Recognition for the edges is awful if you just look at it, but is not harder than COLL or something, if you use sticker colour recognition.

''The cases are not listed on the internet, some day you may find them here...''
===Mad:===
*All in one?
*Forget it! There are thousands of cases. (six times ZBF2L)

=LPEPLL Cases=
{{Algnote}}
Some algs may need a leading [[AUF]] if you are in the same position as the image, these are not explicity written here. 
The average number of moves is 6 [[HTM]] not including any leading or ending AUF. All cases are having the same probability (1:2 R or L and 1:6 within these groups). 
The images assumes the UF edge is solved if the pair is above the slot, if it is some diffrent edge than UF, then just AUF it to solved position for recognition. 
The names for the cases are where two of the edges will go, if it is a R side case, then these are first the edge sitting in UL and then the one in UB. For the L side cases these are UR and UB.
==R side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== R LB ===
{{case
|image=LPELL_RLB.jpg
|name=R LB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=All solved here, but just placing the pair will swap two edges, that are optimally solved by sneaking in a backside Amtisune.}}
{{Alg|R U' R2 U2 R U R' U R}}
| width="50%" |

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

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

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

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

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

==L side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== L RB ===
{{case
|image=LPELL_LRB.jpg
|name=L RB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=Mirror of R LB.}}
{{Alg|L' U L2 U2 L' U' L U' L'}}
| width="50%" |

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

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

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

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

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

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

__NOTOC__

LPELL

2011-03-16T18:05:46Z

Kenneth: /* R LR */ typo

{{Method Infobox
|name=LPELL
|image=LPELLinfo.png
|proposers=[[Kenneth Gustavsson]]
|year=2011
|anames=
|variants=[[ZBF2L]], [[VHF2L]]
|steps=2 or 1.5
|algs=2x6 or 2x48
|moves=? [[HTM]]
|purpose=[[FMC]], [[Speedsolving]]
}}
'''Last pair and edges of the last layer''' is a [[method]] that solves the last [[F2L|F2L pair]] and all edges of the last layer.

===Intermediate:===
This is diveded into two [[sub step]]s:
* '''LPEOLL''', orient all edges and pair up (any order). This is a intuitive step. Using algorithms is possible but you would need the same number as for [[ZBF2L]].
* '''LPEPLL''', place the last pair and permute all edges, that are six cases and their mirrors.

LPELL is mabye not so useful for [[speedsolving]] but for [[FMC]], after the step is done you will have [[L4C]] left, 1:3 times it will be only [[L3C]] and 1:324 you will have a compleate LL-skip. All L4C cases are easy to solve using one or two [[commutator]]s. In FMC, to save moves the commutators are preferably [[insert]]ed in the [[skeleton]] if such a point is found.

''Optimal algs for the second step are found lower at this page.''

===Advanced:===
A second way to solve this step is to first pair up and then do the rest in one look. There are 48 + 48 mirror cases for the second half. An advanced method that, if you include L4C places the last pair and solve all of the last layer in two looks and 'only' 180 algs. Recognition for the edges is awful if you just look at it, but is not harder than COLL or something, if you use sticker colour recognition.

''The cases are not listed on the internet, some day you may find them here...''
===Mad:===
*All in one?
*Forget it! There are thousands of cases. (six times ZBF2L)

=LPEPLL Cases=
{{Algnote}}
Some algs may need a leading [[AUF]] if you are in the same position as the image, these are not explicity written here. 
The average number of moves is 6 [[HTM]] not including any leading or ending AUF. All cases are having the same probability (1:2 R or L and 1:6 within these groups). 
The images assumes the UF edge is solved if the pair is above the slot, if it is some diffrent edge than UF, then just AUF it to solved position for recognition. 
The names for the cases are where two of the edges will go, if it is a R side case, then these are first the edge sitting in UL and then the one in UB. For the L side cases these are UR and UB.
==R side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== R LB ===
{{case
|image=LPELL_RLB.jpg
|name=R LB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=All solved here, but just placing the pair will swap two edges, that are optimally solved by sneaking in a backside Amtisune.}}
{{Alg|R U' R2 U2 R U R' U R}}
| width="50%" |

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

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

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

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

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

==L side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== L RB ===
{{case
|image=LPELL_LRB.jpg
|name=L RB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=Mirror of R LB.}}
{{Alg|L' U L2 U2 L' U' L U' L'}}
| width="50%" |

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

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

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

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

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

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

__NOTOC__

LPELL

2011-03-16T15:23:04Z

Kenneth: That will do for now =

{{Method Infobox
|name=LPELL
|image=LPELLinfo.png
|proposers=[[Kenneth Gustavsson]]
|year=2011
|anames=
|variants=[[ZBF2L]], [[VHF2L]]
|steps=2 or 1.5
|algs=2x6 or 2x48
|moves=? [[HTM]]
|purpose=[[FMC]], [[Speedsolving]]
}}
'''Last pair and edges of the last layer''' is a [[method]] that solves the last [[F2L|F2L pair]] and all edges of the last layer.

===Intermediate:===
This is diveded into two [[sub step]]s:
* '''LPEOLL''', orient all edges and pair up (any order). This is a intuitive step. Using algorithms is possible but you would need the same number as for [[ZBF2L]].
* '''LPEPLL''', place the last pair and permute all edges, that are six cases and their mirrors.

LPELL is mabye not so useful for [[speedsolving]] but for [[FMC]], after the step is done you will have [[L4C]] left, 1:3 times it will be only [[L3C]] and 1:324 you will have a compleate LL-skip. All L4C cases are easy to solve using one or two [[commutator]]s. In FMC, to save moves the commutators are preferably [[insert]]ed in the [[skeleton]] if such a point is found.

''Optimal algs for the second step are found lower at this page.''

===Advanced:===
A second way to solve this step is to first pair up and then do the rest in one look. There are 48 + 48 mirror cases for the second half. An advanced method that, if you include L4C places the last pair and solve all of the last layer in two looks and 'only' 180 algs. Recognition for the edges is awful if you just look at it, but is not harder than COLL or something, if you use sticker colour recognition.

''The cases are not listed on the internet, some day you may find them here...''
===Mad:===
*All in one?
*Forget it! There are thousands of cases. (six times ZBF2L)

=LPEPLL Cases=
{{Algnote}}
Some algs may need a leading [[AUF]] if you are in the same position as the image, these are not explicity written here. 
The average number of moves is 6 [[HTM]] not including any leading or ending AUF. All cases are having the same probability (1:2 R or L and 1:6 within these groups). 
The images assumes the UF edge is solved if the pair is above the slot, if it is some diffrent edge than UF, then just AUF it to solved position for recognition. 
The names for the cases are where two of the edges will go, if it is a R side case, then these are first the edge sitting in UL and then the one in UB. For the L side cases these are UR and UB.
==R side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== R LB ===
{{case
|image=LPELL_RLB.jpg
|name=R LB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=All solved here, but just placing the pair will swap two edges, that are optimally solved by sneaking in a backside Amtisune.}}
{{Alg|R U' R2 U2 R U R' U R}}
| width="50%" |

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

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

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

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

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

==L side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== L RB ===
{{case
|image=LPELL_LRB.jpg
|name=L RB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=Mirror of R LB.}}
{{Alg|L' U L2 U2 L' U' L U' L'}}
| width="50%" |

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

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

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

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

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

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

__NOTOC__

LPELL

2011-03-16T15:16:46Z

Kenneth: /* LPEPLL Cases */

{{Method Infobox
|name=LPELL
|image=LPELLinfo.png
|proposers=[[Kenneth Gustavsson]]
|year=2011
|anames=
|variants=[[ZBF2L]], [[VHF2L]]
|steps=2 or 1.5
|algs=2x6 or 2x48
|moves=? [[HTM]]
|purpose=[[FMC]], [[Speedsolving]]
}}
'''Last pair and edges of the last layer''' is a [[method]] that solves the last [[F2L|F2L pair]] and all edges of the last layer.

===Intermediate:===
This is diveded into two [[sub step]]s:
* '''LPEOLL''', orient all edges and pair up (any order). This is a intuitive step. Using algorithms is possible but you would need the same number as for [[ZBF2L]].
* '''LPEPLL''', place the last pair and permute all edges, that are six cases and their mirrors.

LPELL is mabye not so useful for [[speedsolving]] but for [[FMC]], after the step is done you will have [[L4C]] left, 1:3 times it will be only [[L3C]] and 1:324 you will have a compleate LL-skip. All L4C cases are easy to solve using one or two [[commutator]]s. In FMC, to save moves the commutators are preferably [[insert]]ed in the [[skeleton]] if such a point is found.

''Optimal algs for the second sub step are found lower at this page.''

===Advanced:===
A second way to solve this step is to first pair up and then do the rest in one look. There are 48 + 48 mirror cases for the second half. An advanced method that, if you include L4C places the last pair and solve all of the last layer in two looks and 'only' 180 algs. Recognition for the edges is awful if you just look at it, but is not harder than COLL or something, if you use sticker colour recognition.

''The cases are not listed on the internet, some day you may find them here...''
===Mad:===
*All in one?
*Forget it! There are thousands of cases. (six times ZBF2L)

=LPEPLL Cases=
{{Algnote}}
Some algs may need a leading [[AUF]] if you are in the same position as the image, these are not explicity written here. 
The average number of moves is 6 [[HTM]] not including any leading or ending AUF. All cases are having the same probability (1:2 R or L and 1:6 within these groups). 
The images assumes the UF edge is solved if the pair is above the slot, if it is some diffrent edge than UF, then just AUF it to solved position for recognition. 
The names for the cases are where two of the edges will go, if it is a R side case, then these are first the edge sitting in UL and then the one in UB. For the L side cases these are UR and UB.
==R side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== R LB ===
{{case
|image=LPELL_RLB.jpg
|name=R LB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=All solved here, but just placing the pair will swap two edges, that are optimally solved by sneaking in a backside Amtisune.}}
{{Alg|R U' R2 U2 R U R' U R}}
| width="50%" |

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

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

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

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

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

==L side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== L RB ===
{{case
|image=LPELL_LRB.jpg
|name=L RB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=Mirror of R LB.}}
{{Alg|L' U L2 U2 L' U' L U' L'}}
| width="50%" |

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

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

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

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

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

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

__NOTOC__

LPELL

2011-03-16T15:10:50Z

Kenneth: /* L BL */

{{Method Infobox
|name=LPELL
|image=LPELLinfo.png
|proposers=[[Kenneth Gustavsson]]
|year=2011
|anames=
|variants=[[ZBF2L]], [[VHF2L]]
|steps=2 or 1.5
|algs=2x6 or 2x48
|moves=? [[HTM]]
|purpose=[[FMC]], [[Speedsolving]]
}}
'''Last pair and edges of the last layer''' is a [[method]] that solves the last [[F2L|F2L pair]] and all edges of the last layer.

===Intermediate:===
This is diveded into two [[sub step]]s:
* '''LPEOLL''', orient all edges and pair up (any order). This is a intuitive step. Using algorithms is possible but you would need the same number as for [[ZBF2L]].
* '''LPEPLL''', place the last pair and permute all edges, that are six cases and their mirrors.

LPELL is mabye not so useful for [[speedsolving]] but for [[FMC]], after the step is done you will have [[L4C]] left, 1:3 times it will be only [[L3C]] and 1:324 you will have a compleate LL-skip. All L4C cases are easy to solve using one or two [[commutator]]s. In FMC, to save moves the commutators are preferably [[insert]]ed in the [[skeleton]] if such a point is found.

''Optimal algs for the second sub step are found lower at this page.''

===Advanced:===
A second way to solve this step is to first pair up and then do the rest in one look. There are 48 + 48 mirror cases for the second half. An advanced method that, if you include L4C places the last pair and solve all of the last layer in two looks and 'only' 180 algs. Recognition for the edges is awful if you just look at it, but is not harder than COLL or something, if you use sticker colour recognition.

''The cases are not listed on the internet, some day you may find them here...''
===Mad:===
*All in one?
*Forget it! There are thousands of cases. (six times ZBF2L)

=LPEPLL Cases=
{{Algnote}}
Some algs may need a leading [[AUF]] if you are in the same position as the image, these are not explicity written here. 
The average number of moves is 6 [[HTM]] not including any leading or ending AUF. All cases are having the same probability (1:2 R or L and 1:6 within these groups). 
The images assumes the UF edge is solved if the pair is above the slot, if it is some diffrent edge than UF, then just AUF it to solved position for recognition. 
The names for the cases is where two of the edges will go, if it is a R side case, then these are first the edge sitting in UL and then the one in UB. For the L side cases these are UR and UB.
==R side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== R LB ===
{{case
|image=LPELL_RLB.jpg
|name=R LB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=All solved here, but just placing the pair will swap two edges, that are optimally solved by sneaking in a backside Amtisune.}}
{{Alg|R U' R2 U2 R U R' U R}}
| width="50%" |

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

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

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

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

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

==L side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== L RB ===
{{case
|image=LPELL_LRB.jpg
|name=L RB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=Mirror of R LB.}}
{{Alg|L' U L2 U2 L' U' L U' L'}}
| width="50%" |

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

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

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

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

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

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

__NOTOC__

LPELL

2011-03-16T15:06:47Z

Kenneth: /* LPEPLL Cases */

{{Method Infobox
|name=LPELL
|image=LPELLinfo.png
|proposers=[[Kenneth Gustavsson]]
|year=2011
|anames=
|variants=[[ZBF2L]], [[VHF2L]]
|steps=2 or 1.5
|algs=2x6 or 2x48
|moves=? [[HTM]]
|purpose=[[FMC]], [[Speedsolving]]
}}
'''Last pair and edges of the last layer''' is a [[method]] that solves the last [[F2L|F2L pair]] and all edges of the last layer.

===Intermediate:===
This is diveded into two [[sub step]]s:
* '''LPEOLL''', orient all edges and pair up (any order). This is a intuitive step. Using algorithms is possible but you would need the same number as for [[ZBF2L]].
* '''LPEPLL''', place the last pair and permute all edges, that are six cases and their mirrors.

LPELL is mabye not so useful for [[speedsolving]] but for [[FMC]], after the step is done you will have [[L4C]] left, 1:3 times it will be only [[L3C]] and 1:324 you will have a compleate LL-skip. All L4C cases are easy to solve using one or two [[commutator]]s. In FMC, to save moves the commutators are preferably [[insert]]ed in the [[skeleton]] if such a point is found.

''Optimal algs for the second sub step are found lower at this page.''

===Advanced:===
A second way to solve this step is to first pair up and then do the rest in one look. There are 48 + 48 mirror cases for the second half. An advanced method that, if you include L4C places the last pair and solve all of the last layer in two looks and 'only' 180 algs. Recognition for the edges is awful if you just look at it, but is not harder than COLL or something, if you use sticker colour recognition.

''The cases are not listed on the internet, some day you may find them here...''
===Mad:===
*All in one?
*Forget it! There are thousands of cases. (six times ZBF2L)

=LPEPLL Cases=
{{Algnote}}
Some algs may need a leading [[AUF]] if you are in the same position as the image, these are not explicity written here. 
The average number of moves is 6 [[HTM]] not including any leading or ending AUF. All cases are having the same probability (1:2 R or L and 1:6 within these groups). 
The images assumes the UF edge is solved if the pair is above the slot, if it is some diffrent edge than UF, then just AUF it to solved position for recognition. 
The names for the cases is where two of the edges will go, if it is a R side case, then these are first the edge sitting in UL and then the one in UB. For the L side cases these are UR and UB.
==R side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== R LB ===
{{case
|image=LPELL_RLB.jpg
|name=R LB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=All solved here, but just placing the pair will swap two edges, that are optimally solved by sneaking in a backside Amtisune.}}
{{Alg|R U' R2 U2 R U R' U R}}
| width="50%" |

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

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

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

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

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

==L side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== L RB ===
{{case
|image=LPELL_LRB.jpg
|name=L RB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=Mirror of R LB.}}
{{Alg|L' U L2 U2 L' U' L U' L'}}
| width="50%" |

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

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

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

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

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

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

__NOTOC__

LPELL

2011-03-16T15:05:25Z

Kenneth: /* LPEPLL Cases */

{{Method Infobox
|name=LPELL
|image=LPELLinfo.png
|proposers=[[Kenneth Gustavsson]]
|year=2011
|anames=
|variants=[[ZBF2L]], [[VHF2L]]
|steps=2 or 1.5
|algs=2x6 or 2x48
|moves=? [[HTM]]
|purpose=[[FMC]], [[Speedsolving]]
}}
'''Last pair and edges of the last layer''' is a [[method]] that solves the last [[F2L|F2L pair]] and all edges of the last layer.

===Intermediate:===
This is diveded into two [[sub step]]s:
* '''LPEOLL''', orient all edges and pair up (any order). This is a intuitive step. Using algorithms is possible but you would need the same number as for [[ZBF2L]].
* '''LPEPLL''', place the last pair and permute all edges, that are six cases and their mirrors.

LPELL is mabye not so useful for [[speedsolving]] but for [[FMC]], after the step is done you will have [[L4C]] left, 1:3 times it will be only [[L3C]] and 1:324 you will have a compleate LL-skip. All L4C cases are easy to solve using one or two [[commutator]]s. In FMC, to save moves the commutators are preferably [[insert]]ed in the [[skeleton]] if such a point is found.

''Optimal algs for the second sub step are found lower at this page.''

===Advanced:===
A second way to solve this step is to first pair up and then do the rest in one look. There are 48 + 48 mirror cases for the second half. An advanced method that, if you include L4C places the last pair and solve all of the last layer in two looks and 'only' 180 algs. Recognition for the edges is awful if you just look at it, but is not harder than COLL or something, if you use sticker colour recognition.

''The cases are not listed on the internet, some day you may find them here...''
===Mad:===
*All in one?
*Forget it! There are thousands of cases. (six times ZBF2L)

=LPEPLL Cases=
{{Algnote}}
Some algs may need a leading [[AUF]] if you are in the same position as the image, these are not explicity written here. 
The average number of moves is 6 [[HTM]] not including any leading or ending AUF. All cases are having the same probability (1:2 R or L and 1:6 within these groups). 
The images assumes the UF edge is solved if the pair is above the slot, if it is some diffrent edge than UF, then just AUF it to solved position for recognition. 
The names for the cases is where two of the edges will go, if it is a R side case, then these are first the edge sitting in UL and then the one in UB and for L cases these are UR and UB.
==R side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== R LB ===
{{case
|image=LPELL_RLB.jpg
|name=R LB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=All solved here, but just placing the pair will swap two edges, that are optimally solved by sneaking in a backside Amtisune.}}
{{Alg|R U' R2 U2 R U R' U R}}
| width="50%" |

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

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

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

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

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

==L side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== L RB ===
{{case
|image=LPELL_LRB.jpg
|name=L RB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=Mirror of R LB.}}
{{Alg|L' U L2 U2 L' U' L U' L'}}
| width="50%" |

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

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

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

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

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

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

__NOTOC__

LPELL

2011-03-16T15:04:19Z

Kenneth: /* LPEPLL Cases */

{{Method Infobox
|name=LPELL
|image=LPELLinfo.png
|proposers=[[Kenneth Gustavsson]]
|year=2011
|anames=
|variants=[[ZBF2L]], [[VHF2L]]
|steps=2 or 1.5
|algs=2x6 or 2x48
|moves=? [[HTM]]
|purpose=[[FMC]], [[Speedsolving]]
}}
'''Last pair and edges of the last layer''' is a [[method]] that solves the last [[F2L|F2L pair]] and all edges of the last layer.

===Intermediate:===
This is diveded into two [[sub step]]s:
* '''LPEOLL''', orient all edges and pair up (any order). This is a intuitive step. Using algorithms is possible but you would need the same number as for [[ZBF2L]].
* '''LPEPLL''', place the last pair and permute all edges, that are six cases and their mirrors.

LPELL is mabye not so useful for [[speedsolving]] but for [[FMC]], after the step is done you will have [[L4C]] left, 1:3 times it will be only [[L3C]] and 1:324 you will have a compleate LL-skip. All L4C cases are easy to solve using one or two [[commutator]]s. In FMC, to save moves the commutators are preferably [[insert]]ed in the [[skeleton]] if such a point is found.

''Optimal algs for the second sub step are found lower at this page.''

===Advanced:===
A second way to solve this step is to first pair up and then do the rest in one look. There are 48 + 48 mirror cases for the second half. An advanced method that, if you include L4C places the last pair and solve all of the last layer in two looks and 'only' 180 algs. Recognition for the edges is awful if you just look at it, but is not harder than COLL or something, if you use sticker colour recognition.

''The cases are not listed on the internet, some day you may find them here...''
===Mad:===
*All in one?
*Forget it! There are thousands of cases. (six times ZBF2L)

=LPEPLL Cases=
{{Algnote}}
Some algs may need a leading [[AUF]] if you are in the same position as the image, these are not explicity written here. 
The average number of moves is 6 [[HTM]] not including any leading or ending AUF. All cases are having the same probability (50% R or L and 1:6 within these groups). 
The images assumes the UF edge is solved if the pair is above the slot, if it is some diffrent edge than UF, then just AUF it to solved position for recognition. 
The names for the cases is where two of the edges will go, if it is a R side case, then these are first the edge sitting in UL and then the one in UB and for L cases these are UR and UB.
==R side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== R LB ===
{{case
|image=LPELL_RLB.jpg
|name=R LB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=All solved here, but just placing the pair will swap two edges, that are optimally solved by sneaking in a backside Amtisune.}}
{{Alg|R U' R2 U2 R U R' U R}}
| width="50%" |

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

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

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

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

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

==L side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== L RB ===
{{case
|image=LPELL_LRB.jpg
|name=L RB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=Mirror of R LB.}}
{{Alg|L' U L2 U2 L' U' L U' L'}}
| width="50%" |

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

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

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

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

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

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

__NOTOC__

LPELL

2011-03-16T15:00:48Z

Kenneth: /* LPEPLL Cases */

{{Method Infobox
|name=LPELL
|image=LPELLinfo.png
|proposers=[[Kenneth Gustavsson]]
|year=2011
|anames=
|variants=[[ZBF2L]], [[VHF2L]]
|steps=2 or 1.5
|algs=2x6 or 2x48
|moves=? [[HTM]]
|purpose=[[FMC]], [[Speedsolving]]
}}
'''Last pair and edges of the last layer''' is a [[method]] that solves the last [[F2L|F2L pair]] and all edges of the last layer.

===Intermediate:===
This is diveded into two [[sub step]]s:
* '''LPEOLL''', orient all edges and pair up (any order). This is a intuitive step. Using algorithms is possible but you would need the same number as for [[ZBF2L]].
* '''LPEPLL''', place the last pair and permute all edges, that are six cases and their mirrors.

LPELL is mabye not so useful for [[speedsolving]] but for [[FMC]], after the step is done you will have [[L4C]] left, 1:3 times it will be only [[L3C]] and 1:324 you will have a compleate LL-skip. All L4C cases are easy to solve using one or two [[commutator]]s. In FMC, to save moves the commutators are preferably [[insert]]ed in the [[skeleton]] if such a point is found.

''Optimal algs for the second sub step are found lower at this page.''

===Advanced:===
A second way to solve this step is to first pair up and then do the rest in one look. There are 48 + 48 mirror cases for the second half. An advanced method that, if you include L4C places the last pair and solve all of the last layer in two looks and 'only' 180 algs. Recognition for the edges is awful if you just look at it, but is not harder than COLL or something, if you use sticker colour recognition.

''The cases are not listed on the internet, some day you may find them here...''
===Mad:===
*All in one?
*Forget it! There are thousands of cases. (six times ZBF2L)

=LPEPLL Cases=
{{Algnote}}
Some algs may need a leading [[AUF]] if you are in the same position as the image, these are not explicity written here. 
The average number of moves is 6 [[HTM]] not including any leading or ending AUF. All cases are having the same probability. 
The images assumes the UF edge is solved if the pair is above the slot, if it is some diffrent edge than UF, then just AUF it to solved position for recognition.
==R side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== R LB ===
{{case
|image=LPELL_RLB.jpg
|name=R LB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=All solved here, but just placing the pair will swap two edges, that are optimally solved by sneaking in a backside Amtisune.}}
{{Alg|R U' R2 U2 R U R' U R}}
| width="50%" |

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

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

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

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

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

==L side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== L RB ===
{{case
|image=LPELL_LRB.jpg
|name=L RB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=Mirror of R LB.}}
{{Alg|L' U L2 U2 L' U' L U' L'}}
| width="50%" |

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

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

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

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

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

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

__NOTOC__

LPELL

2011-03-16T14:56:31Z

Kenneth:

{{Method Infobox
|name=LPELL
|image=LPELLinfo.png
|proposers=[[Kenneth Gustavsson]]
|year=2011
|anames=
|variants=[[ZBF2L]], [[VHF2L]]
|steps=2 or 1.5
|algs=2x6 or 2x48
|moves=? [[HTM]]
|purpose=[[FMC]], [[Speedsolving]]
}}
'''Last pair and edges of the last layer''' is a [[method]] that solves the last [[F2L|F2L pair]] and all edges of the last layer.

===Intermediate:===
This is diveded into two [[sub step]]s:
* '''LPEOLL''', orient all edges and pair up (any order). This is a intuitive step. Using algorithms is possible but you would need the same number as for [[ZBF2L]].
* '''LPEPLL''', place the last pair and permute all edges, that are six cases and their mirrors.

LPELL is mabye not so useful for [[speedsolving]] but for [[FMC]], after the step is done you will have [[L4C]] left, 1:3 times it will be only [[L3C]] and 1:324 you will have a compleate LL-skip. All L4C cases are easy to solve using one or two [[commutator]]s. In FMC, to save moves the commutators are preferably [[insert]]ed in the [[skeleton]] if such a point is found.

''Optimal algs for the second sub step are found lower at this page.''

===Advanced:===
A second way to solve this step is to first pair up and then do the rest in one look. There are 48 + 48 mirror cases for the second half. An advanced method that, if you include L4C places the last pair and solve all of the last layer in two looks and 'only' 180 algs. Recognition for the edges is awful if you just look at it, but is not harder than COLL or something, if you use sticker colour recognition.

''The cases are not listed on the internet, some day you may find them here...''
===Mad:===
*All in one?
*Forget it! There are thousands of cases. (six times ZBF2L)

=LPEPLL Cases=
{{Algnote}}
Some algs may need a leading [[AUF]] if you are in the same position as the image, these are not explicity written here. 
The average number of moves is 6 [[HTM]] not including any leading or ending AUF.
==R side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== R LB ===
{{case
|image=LPELL_RLB.jpg
|name=R LB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=All solved here, but just placing the pair will swap two edges, that are optimally solved by sneaking in a backside Amtisune.}}
{{Alg|R U' R2 U2 R U R' U R}}
| width="50%" |

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

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

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

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

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

==L side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== L RB ===
{{case
|image=LPELL_LRB.jpg
|name=L RB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=Mirror of R LB.}}
{{Alg|L' U L2 U2 L' U' L U' L'}}
| width="50%" |

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

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

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

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

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

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

__NOTOC__

LPELL

2011-03-16T14:54:52Z

Kenneth: /* Intermediate: */

{{Method Infobox
|name=LPELL
|image=LPELLinfo.png
|proposers=[[Kenneth Gustavsson]]
|year=2011
|anames=
|variants=[[ZBF2L]], [[VHF2L]]
|steps=2 or 1.5
|algs=2x6 or 2x48
|moves=? [[HTM]]
|purpose=
* [[FMC]], [[Speedsolving]]
}}
'''Last pair and edges of the last layer''' is a [[method]] that solves the last [[F2L|F2L pair]] and all edges of the last layer.

===Intermediate:===
This is diveded into two [[sub step]]s:
* '''LPEOLL''', orient all edges and pair up (any order). This is a intuitive step. Using algorithms is possible but you would need the same number as for [[ZBF2L]].
* '''LPEPLL''', place the last pair and permute all edges, that are six cases and their mirrors.

LPELL is mabye not so useful for [[speedsolving]] but for [[FMC]], after the step is done you will have [[L4C]] left, 1:3 times it will be only [[L3C]] and 1:324 you will have a compleate LL-skip. All L4C cases are easy to solve using one or two [[commutator]]s. In FMC, to save moves the commutators are preferably [[insert]]ed in the [[skeleton]] if such a point is found.

''Optimal algs for the second sub step are found lower at this page.''

===Advanced:===
A second way to solve this step is to first pair up and then do the rest in one look. There are 48 + 48 mirror cases for the second half. An advanced method that, if you include L4C places the last pair and solve all of the last layer in two looks and 'only' 180 algs. Recognition for the edges is awful if you just look at it, but is not harder than COLL or something, if you use sticker colour recognition.

''The cases are not listed on the internet, some day you may find them here...''
===Mad:===
*All in one?
*Forget it! There are thousands of cases. (six times ZBF2L)

=LPEPLL Cases=
{{Algnote}}
Some algs may need a leading [[AUF]] if you are in the same position as the image, these are not explicity written here. 
The average number of moves is 6 [[HTM]] not including any leading or ending AUF.
==R side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== R LB ===
{{case
|image=LPELL_RLB.jpg
|name=R LB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=All solved here, but just placing the pair will swap two edges, that are optimally solved by sneaking in a backside Amtisune.}}
{{Alg|R U' R2 U2 R U R' U R}}
| width="50%" |

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

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

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

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

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

==L side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== L RB ===
{{case
|image=LPELL_LRB.jpg
|name=L RB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=Mirror of R LB.}}
{{Alg|L' U L2 U2 L' U' L U' L'}}
| width="50%" |

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

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

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

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

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

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

__NOTOC__

File:LPELL LRL.jpg

2011-03-16T14:52:30Z

Kenneth: LPELL

[[LPELL]]

File:LPELL LRB.jpg

2011-03-16T14:52:07Z

Kenneth: LPELL

[[LPELL]]

File:LPELL LLR.jpg

2011-03-16T14:51:44Z

Kenneth: LPELL

[[LPELL]]

File:LPELL LLB.jpg

2011-03-16T14:51:18Z

Kenneth: LPELL

[[LPELL]]

File:LPELL LBR.jpg

2011-03-16T14:50:59Z

Kenneth: LPELL

[[LPELL]]

File:LPELL LBL.jpg

2011-03-16T14:50:39Z

Kenneth: LPELL

[[LPELL]]

LPELL

2011-03-16T14:50:05Z

Kenneth: /* R cases */

{{Method Infobox
|name=LPELL
|image=LPELLinfo.png
|proposers=[[Kenneth Gustavsson]]
|year=2011
|anames=
|variants=[[ZBF2L]], [[VHF2L]]
|steps=2 or 1.5
|algs=2x6 or 2x48
|moves=? [[HTM]]
|purpose=
* [[FMC]], [[Speedsolving]]
}}
'''Last pair and edges of the last layer''' is a [[method]] that solves the last [[F2L|F2L pair]] and all edges of the last layer.

===Intermediate:===
This is diveded into two [[sub step]]s:
* '''LPEOLL''', orient all edges and pair up (any order). This is a intuitive step. Using algorithms is possible but you would need the same number as for [[ZBF2L]].
* '''LPEPLL''', place the last pair and permute all edges, that are six cases and their mirrors.

LPELL is mabye not so useful for [[speedsolving]] but for [[FMC]], after the step is done you will have [[L4C]] left, 1:3 times it will be only [[L3C]] and 1:324 you will have a compleate LL-skip. All L4C cases are easy to solve using one or two [[commutator]]s. In FMC, to save moves the commutators are preferably [[insert]]ed in the [[skeleton]] if such a point is found.

''Optimal algs for the second are found lower at this page.''

===Advanced:===
A second way to solve this step is to first pair up and then do the rest in one look. There are 48 + 48 mirror cases for the second half. An advanced method that, if you include L4C places the last pair and solve all of the last layer in two looks and 'only' 180 algs. Recognition for the edges is awful if you just look at it, but is not harder than COLL or something, if you use sticker colour recognition.

''The cases are not listed on the internet, some day you may find them here...''
===Mad:===
*All in one?
*Forget it! There are thousands of cases. (six times ZBF2L)

=LPEPLL Cases=
{{Algnote}}
Some algs may need a leading [[AUF]] if you are in the same position as the image, these are not explicity written here. 
The average number of moves is 6 [[HTM]] not including any leading or ending AUF.
==R side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== R LB ===
{{case
|image=LPELL_RLB.jpg
|name=R LB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=All solved here, but just placing the pair will swap two edges, that are optimally solved by sneaking in a backside Amtisune.}}
{{Alg|R U' R2 U2 R U R' U R}}
| width="50%" |

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

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

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

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

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

==L side pair==
{|border="0" width="100%" valign="top" cellpadding="3"
|-valign="top"
| width="50%" |
=== L RB ===
{{case
|image=LPELL_LRB.jpg
|name=L RB
|methods=LPEPLL
|optimal=9 [[HTM]]
|text=Mirror of R LB.}}
{{Alg|L' U L2 U2 L' U' L U' L'}}
| width="50%" |

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

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

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

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

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

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

__NOTOC__

LPELL

2011-03-16T13:53:39Z

Kenneth: /* LPEPLL Cases */

LPELL

2011-03-16T13:53:16Z

Kenneth: /* LPEPLL Cases */