<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://www.speedsolving.com/wiki/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Pcharles93</id>
	<title>Speedsolving.com Wiki - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://www.speedsolving.com/wiki/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Pcharles93"/>
	<link rel="alternate" type="text/html" href="https://www.speedsolving.com/wiki/index.php/Special:Contributions/Pcharles93"/>
	<updated>2026-11-04T11:07:28Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.43.8</generator>
	<entry>
		<id>https://www.speedsolving.com/wiki/index.php?title=Forum_cubers_by_location&amp;diff=3246</id>
		<title>Forum cubers by location</title>
		<link rel="alternate" type="text/html" href="https://www.speedsolving.com/wiki/index.php?title=Forum_cubers_by_location&amp;diff=3246"/>
		<updated>2009-03-19T08:48:48Z</updated>

		<summary type="html">&lt;p&gt;Pcharles93: /* United States */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__NOTOC__&lt;br /&gt;
=Speedsolving.com Forum Cubers by Location=&lt;br /&gt;
&lt;br /&gt;
This is a list of the members of the speedsolving.com forum by their location. This list is not complete, so if you notice someone who is not on this list feel free to add their name under the category for their country. If the country is not already listed, go ahead and create a new category for it.&lt;br /&gt;
&lt;br /&gt;
Another list of cubers by location can be found on [http://www.frappr.com/speedcubers Frappr].&lt;br /&gt;
&lt;br /&gt;
==Africa==&lt;br /&gt;
&lt;br /&gt;
===South Africa===&lt;br /&gt;
:[http://www.speedsolving.com/forum/member.php?u=1176 DAE_JA_VOO]&lt;br /&gt;
&lt;br /&gt;
==Asia==&lt;br /&gt;
&lt;br /&gt;
===India===&lt;br /&gt;
:[http://www.speedsolving.com/forum/member.php?u=311 Karthik]&lt;br /&gt;
&lt;br /&gt;
==Europe==&lt;br /&gt;
&lt;br /&gt;
===Denmark===&lt;br /&gt;
:[http://www.speedsolving.com/forum/member.php?u=474 LarsN] -- &#039;&#039;Lars Vennike Nielsson&#039;&#039; -- [http://www.worldcubeassociation.org/results/p.php?i=2008NIEL01 WCA Profile]&lt;br /&gt;
&lt;br /&gt;
===France===&lt;br /&gt;
:&#039;&#039;&#039;Paris&#039;&#039;&#039;&lt;br /&gt;
::[http://www.speedsolving.com/forum/member.php?u=1684 TMOY]&lt;br /&gt;
&lt;br /&gt;
===Sweden===&lt;br /&gt;
:&#039;&#039;&#039;Stockholm&#039;&#039;&#039;&lt;br /&gt;
::[http://www.speedsolving.com/forum/member.php?u=479 Kenneth] -- &#039;&#039;[[User:Kenneth|Kenneth Gustavsson]]&#039;&#039; -- [http://www.worldcubeassociation.org/results/p.php?i=2005GUST01 WCA Profile]&lt;br /&gt;
::[http://www.speedsolving.com/forum/member.php?u=1673 Coinman] -- &#039;&#039;Tommy Gustavsson&#039;&#039; -- [http://www.worldcubeassociation.org/results/p.php?i=2005GUST02 WCA Profile]&lt;br /&gt;
&lt;br /&gt;
===United Kingdom===&lt;br /&gt;
:[http://www.speedsolving.com/forum/member.php?u=1742 msemtd] -- Michael Erskine, Sherwood, Nottingham. [http://www.worldcubeassociation.org/results/p.php?i=2008ERSK01 WCA profile] --[[User:Msemtd|Msemtd]]&lt;br /&gt;
&lt;br /&gt;
==North America==&lt;br /&gt;
&lt;br /&gt;
===Canada===&lt;br /&gt;
:&#039;&#039;&#039;Saskatchewan&#039;&#039;&#039;&lt;br /&gt;
::[http://www.speedsolving.com/forum/member.php?u=1569 Connorcuber]&lt;br /&gt;
:&#039;&#039;&#039;Ontatio&#039;&#039;&#039;&lt;br /&gt;
::[http://www.speedsolving.com/forum/member.php?u=1144 Sa967St]&lt;br /&gt;
&lt;br /&gt;
===United States===&lt;br /&gt;
:&#039;&#039;&#039;AL (Alabama)&#039;&#039;&#039;&lt;br /&gt;
::[http://www.speedsolving.com/forum/member.php?u=1119 Adam Morgan (ajmorgan25)]&lt;br /&gt;
:&#039;&#039;&#039;CA (California)&#039;&#039;&#039;&lt;br /&gt;
::[http://www.speedsolving.com/forum/member.php?u=1707 Unknown.soul]&lt;br /&gt;
::&#039;&#039;&#039;San Francisco Bay Area&#039;&#039;&#039;&lt;br /&gt;
:::[http://www.speedsolving.com/forum/member.php?u=182 deathbypapercutz]&lt;br /&gt;
:::[http://www.speedsolving.com/forum/member.php?u=2 Lucas Garron]&lt;br /&gt;
:::[http://www.speedsolving.com/forum/member.php?u=657 whatsinacube]&lt;br /&gt;
::&#039;&#039;&#039;Los Angeles Area&#039;&#039;&#039;&lt;br /&gt;
:::[http://www.speedsolving.com/forum/member.php?u=765 Dene] (first half of 2009)&lt;br /&gt;
:::[http://www.speedsolving.com/forum/member.php?u=808 qqwref] - [[User:Qqwref|qqwref]] (when at college)&lt;br /&gt;
:&#039;&#039;&#039;CO (Colorado)&#039;&#039;&#039;&lt;br /&gt;
::[http://www.speedsolving.com/forum/member.php?u=1 PJK]&lt;br /&gt;
:&#039;&#039;&#039;GA (Georgia)&#039;&#039;&#039;&lt;br /&gt;
::[http://www.speedsolving.com/forum/member.php?u=1042 Hadley4000]&lt;br /&gt;
:&#039;&#039;&#039;IN (Indiana)&#039;&#039;&#039;&lt;br /&gt;
::[http://www.speedsolving.com/forum/member.php?u=402 Mike Hughey] - Indianapolis&lt;br /&gt;
:&#039;&#039;&#039;KY (Kentucky)&#039;&#039;&#039;&lt;br /&gt;
::[http://www.speedsolving.com/forum/member.php?u=872 Shaden Smith] - Lexington&lt;br /&gt;
:&#039;&#039;&#039;MA (Massachusetts)&#039;&#039;&#039;&lt;br /&gt;
::[http://www.speedsolving.com/forum/member.php?u=131 Tim Reynolds] - Cambridge&lt;br /&gt;
:&#039;&#039;&#039;MD (Maryland)&#039;&#039;&#039;&lt;br /&gt;
::[http://www.speedsolving.com/forum/member.php?u=1614 Brett]&lt;br /&gt;
::[http://www.speedsolving.com/forum/member.php?u=768 fanwuq]&lt;br /&gt;
:&#039;&#039;&#039;MN (Minnesota)&#039;&#039;&#039;&lt;br /&gt;
::[http://www.speedsolving.com/forum/member.php?u=640 Bryan Logan] - Rochester&lt;br /&gt;
:&#039;&#039;&#039;MO (Missouri)&#039;&#039;&#039;&lt;br /&gt;
::[http://www.speedsolving.com/forum/member.php?u=1403 Vault312] (during summer)&lt;br /&gt;
:&#039;&#039;&#039;NC (North Carolina)&#039;&#039;&#039;&lt;br /&gt;
::[http://www.speedsolving.com/forum/member.php?u=63 cmhardw] - Morrisville&lt;br /&gt;
::[http://www.speedsolving.com/forum/member.php?u=147 Athefre]&lt;br /&gt;
:&#039;&#039;&#039;NJ (New Jersey)&#039;&#039;&#039;&lt;br /&gt;
::[http://www.speedsolving.com/forum/member.php?u=1309 PatrickJameson]&lt;br /&gt;
::[http://www.speedsolving.com/forum/member.php?u=647 macky] - Princeton&lt;br /&gt;
::[http://www.speedsolving.com/forum/member.php?u=902 Auburn Manlangit] - Northern NJ&lt;br /&gt;
::[http://www.speedsolving.com/forum/member.php?u=76 Bob] - Kearny&lt;br /&gt;
:&#039;&#039;&#039;NM (New Mexico)&#039;&#039;&#039;&lt;br /&gt;
::[http://www.speedsolving.com/forum/member.php?u=1518 Kiel0]&lt;br /&gt;
:&#039;&#039;&#039;NY (New York)&#039;&#039;&#039;&lt;br /&gt;
::[http://www.speedsolving.com/forum/member.php?u=131 Tim Reynolds] Pleasantville (when not at school)&lt;br /&gt;
::[http://www.speedsolving.com/forum/member.php?u=808 qqwref] - [[User:Qqwref|qqwref]] (when at home)&lt;br /&gt;
:&#039;&#039;&#039;OH (Ohio)&#039;&#039;&#039;&lt;br /&gt;
::[http://www.speedsolving.com/forum/member.php?u=1358 JBCM627]&lt;br /&gt;
::[http://www.speedsolving.com/forum/member.php?u=1493 CAT13]&lt;br /&gt;
::[http://www.speedsolving.com/forum/member.php?u=912 Pcharles93]&lt;br /&gt;
:&#039;&#039;&#039;PA (Pennsylvania)&#039;&#039;&#039;&lt;br /&gt;
::[http://www.speedsolving.com/forum/member.php?u=2250 That70sShowDude]&lt;br /&gt;
::[http://www.speedsolving.com/forum/member.php?u=1403 Vault312] (during school year)&lt;br /&gt;
:&#039;&#039;&#039;TX (Texas)&#039;&#039;&#039;&lt;br /&gt;
::[http://www.speedsolving.com/forum/member.php?u=2160 Fobo911]&lt;br /&gt;
:&#039;&#039;&#039;UT (Utah)&#039;&#039;&#039;&lt;br /&gt;
::[http://www.speedsolving.com/forum/member.php?u=1889 not_kevin]&lt;br /&gt;
:&#039;&#039;&#039;VA (Virginia)&#039;&#039;&#039;&lt;br /&gt;
::[http://www.speedsolving.com/forum/member.php?u=792 Siraj A.]&lt;br /&gt;
&lt;br /&gt;
==Oceania==&lt;br /&gt;
&lt;br /&gt;
===Australia===&lt;br /&gt;
:&#039;&#039;&#039;Sydney&#039;&#039;&#039;&lt;br /&gt;
::[http://www.speedsolving.com/forum/member.php?u=1765 Rawn]&lt;br /&gt;
&lt;br /&gt;
===New Zealand===&lt;br /&gt;
:[http://www.speedsolving.com/forum/member.php?u=1293 *LukeMayn*]&lt;br /&gt;
:&#039;&#039;&#039;Hamilton&#039;&#039;&#039;&lt;br /&gt;
::[http://www.speedsolving.com/forum/member.php?u=1345 auhsoj]&lt;br /&gt;
:&#039;&#039;&#039;Christchurch&#039;&#039;&#039;&lt;br /&gt;
::[http://www.speedsolving.com/forum/member.php?u=765 Dene]&lt;br /&gt;
&lt;br /&gt;
==South America==&lt;br /&gt;
&lt;br /&gt;
===Brazil===&lt;br /&gt;
:[http://www.speedsolving.com/forum/member.php?u=11 Pedro]&lt;/div&gt;</summary>
		<author><name>Pcharles93</name></author>
	</entry>
	<entry>
		<id>https://www.speedsolving.com/wiki/index.php?title=PLL&amp;diff=510</id>
		<title>PLL</title>
		<link rel="alternate" type="text/html" href="https://www.speedsolving.com/wiki/index.php?title=PLL&amp;diff=510"/>
		<updated>2008-08-30T02:28:36Z</updated>

		<summary type="html">&lt;p&gt;Pcharles93: /* Z Permutation */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;__NOTOC__&lt;br /&gt;
== Permutation of Last Layer ==&lt;br /&gt;
&lt;br /&gt;
The term &#039;PLL&#039; refers to &#039;Permutation of Last Layer&#039;.  This means the pieces in the &#039;last layer&#039; are being moved.  The digrams below are top views of what the pieces are doing (i.e. the &#039;[http://www.speedsolving.com/wiki/index.php/PLL#T_Permutation T Permutation]&#039; swaps the Upper-Left and Upper-Right edges, as well as the Front-Upper-Right corner and Back-Upper-Right corner).&lt;br /&gt;
&lt;br /&gt;
== V Permutation ==&lt;br /&gt;
&lt;br /&gt;
[[Image:V.gif]]&lt;br /&gt;
&lt;br /&gt;
* [R&#039;U R&#039; U&#039; y&#039; x R&#039; U&#039; R2 x&#039; U&#039; R&#039; U R&#039; F R F]&lt;br /&gt;
* [R&#039;UR&#039;U&#039;-B&#039;DB&#039;D&#039;-B2R&#039;B&#039;RBR]&lt;br /&gt;
* [R&#039; U R&#039; U&#039; x2 y&#039; R&#039; U R&#039; U&#039; l R U&#039; R&#039; U R U]&lt;br /&gt;
* [y L&#039; U R U&#039; L U L&#039; U R&#039; U&#039; L U2 R U2 R&#039;]&lt;br /&gt;
* [y2 R U&#039; L&#039; U R&#039; U&#039; R U&#039; L U R&#039; U2 L&#039; U2 L]&lt;br /&gt;
* [y&#039; R&#039; U L U&#039; R U R&#039; U L&#039; U&#039; R U2 L U2 L&#039;]&lt;br /&gt;
* [L U&#039; R&#039; U L&#039; U&#039; L U&#039; R U L&#039; U2 R&#039; U2 R]&lt;br /&gt;
* [R&#039; U R&#039; d&#039; R&#039; F&#039; R2 U&#039; R&#039; U R&#039; F R F]&lt;br /&gt;
* [R&#039; U R&#039;U&#039; y z&#039; U&#039; R U&#039;R&#039;U2 y&#039; R&#039; U&#039; R U R]  &lt;br /&gt;
-----------------------&lt;br /&gt;
&lt;br /&gt;
== Y Permutation ==&lt;br /&gt;
&lt;br /&gt;
[[Image:Y.gif]]&lt;br /&gt;
&lt;br /&gt;
* [R2 U&#039; R&#039; U R U&#039; z&#039; y&#039; L&#039; U&#039; R U&#039; R&#039; U&#039; L U y z]&lt;br /&gt;
* [F R U&#039; R&#039; U&#039; R U R&#039; F&#039; R U R&#039; U&#039; R&#039; F R F&#039;]&lt;br /&gt;
* [F R U&#039; R&#039; F D R&#039; (y x) R&#039; U&#039; R (z) R2 (y) L&#039; d2]&lt;br /&gt;
* [z&#039; U2 L&#039; U&#039; L U L&#039; y&#039; L&#039; U&#039; R U&#039; R&#039; U&#039; L U]&lt;br /&gt;
* [FR&#039;F&#039;RURU&#039;R2U&#039;RU l U&#039;R&#039;U]&lt;br /&gt;
* [z U2 R U R&#039; U&#039; R y R U L&#039; U L U R&#039; U&#039;]&lt;br /&gt;
&lt;br /&gt;
-----------------------&lt;br /&gt;
&lt;br /&gt;
== U Permutation : a ==&lt;br /&gt;
&lt;br /&gt;
[[Image:u1.gif]]&lt;br /&gt;
&lt;br /&gt;
* [y2 M2 U M U2 M&#039; U M2]&lt;br /&gt;
* [M2 U M&#039; U2 M U M2]&lt;br /&gt;
* [R2 U&#039; R&#039; U&#039; R U R U R U&#039; R]&lt;br /&gt;
* [B2 U&#039; M&#039; U2 M U&#039; B2]&lt;br /&gt;
* [(y2) R U&#039; R U R U R U&#039; R&#039; U&#039; R2]&lt;br /&gt;
* [M2 U M&#039; U2 M U2 M&#039; U2 M U M2]&lt;br /&gt;
&lt;br /&gt;
-----------------------&lt;br /&gt;
&lt;br /&gt;
== U Permutation : b ==&lt;br /&gt;
&lt;br /&gt;
[[Image:u.gif]]&lt;br /&gt;
&lt;br /&gt;
* [y2 M2 U&#039; M U2 M&#039; U&#039; M2]&lt;br /&gt;
* [M2 U&#039; M&#039; U2 M U&#039; M2]&lt;br /&gt;
* [R&#039; U R&#039; U&#039; - R&#039; U&#039; - R&#039; U R U R2]&lt;br /&gt;
* [B2 U M&#039; U2 M U B2]&lt;br /&gt;
* [y2 R2 U R U R&#039; U&#039; R&#039; U&#039; R&#039; U R&#039;]&lt;br /&gt;
* [RU&#039;R URUR&#039; U&#039;R&#039;U&#039;R&#039;U2R&#039;]&lt;br /&gt;
* [M2 U&#039; M&#039; U2 M U2 M&#039; U2 M U&#039; M2]&lt;br /&gt;
&lt;br /&gt;
-----------------------&lt;br /&gt;
&lt;br /&gt;
== T Permutation ==&lt;br /&gt;
&lt;br /&gt;
[[Image:t.gif]]&lt;br /&gt;
&lt;br /&gt;
* [R U R&#039; U&#039; R&#039; F R2 U&#039; R&#039; U&#039; R U R&#039; F&#039;]&lt;br /&gt;
* [F R U&#039; R&#039; U R U R2 F&#039; R U R U&#039; R&#039;]&lt;br /&gt;
* [L2 U&#039; L2 D F2 R2 U R2 D&#039; F2]&lt;br /&gt;
* [R2 U&#039; R2 D B2 L2 U L2 D&#039; B2]&lt;br /&gt;
* [R2&#039; u&#039; R2 U R2&#039; y R2 u R2&#039; U&#039; R2]&lt;br /&gt;
* [R2 U R2&#039; U&#039; R2 U&#039; D R2&#039; U&#039; R2 U R2&#039; D&#039;]&lt;br /&gt;
&lt;br /&gt;
-----------------------&lt;br /&gt;
&lt;br /&gt;
== R Permutation : a ==&lt;br /&gt;
&lt;br /&gt;
[[Image:r1.gif]]&lt;br /&gt;
&lt;br /&gt;
* [y2z UR2U&#039;R2UF&#039;U&#039;R&#039;URUFU2R]&lt;br /&gt;
* [y&#039; R2 B&#039; R&#039; U&#039; R&#039; U R B R&#039; U2 R U2 R&#039;]&lt;br /&gt;
* [R U2 R&#039; U2 R B&#039; R&#039; U&#039; R U R B R2&#039; U]&lt;br /&gt;
* [R U2 R&#039; U2 R B&#039; R&#039; U&#039; R U l U R2 F]&lt;br /&gt;
* [U2 R&#039; U&#039; R U2 R U2 L&#039; R2 U R U&#039; R L U2 R&#039;]&lt;br /&gt;
-----------------------&lt;br /&gt;
&lt;br /&gt;
== R Permutation : b ==&lt;br /&gt;
&lt;br /&gt;
[[Image:r.gif]]&lt;br /&gt;
&lt;br /&gt;
* [R&#039; U2 R U2 R&#039; F R U R&#039; U&#039; R&#039; F&#039; R2&#039; U&#039;]&lt;br /&gt;
* [y R2 B2 U&#039; R&#039; U&#039; R U R U B2 R U&#039; R U]&lt;br /&gt;
* [R&#039; U2 R U&#039; (y&#039;) R&#039; F R B&#039; R&#039; F&#039; R (z x&#039;) R&#039; U R&#039;]&lt;br /&gt;
* [y2 R&#039; U2 l R U&#039; R&#039; U l&#039; U2&#039; R-F R U&#039; R&#039; U&#039; R U R&#039; F&#039;]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
-----------------------&lt;br /&gt;
&lt;br /&gt;
== N Permutation : a ==&lt;br /&gt;
&lt;br /&gt;
[[Image:n1.gif]]&lt;br /&gt;
&lt;br /&gt;
* [z D R&#039; U R2 D&#039; R (U&#039;D) R&#039; U R2 D&#039; R U&#039; R]&lt;br /&gt;
* [y&#039; L U&#039; R U2 L&#039; U R&#039; L U&#039; R U2 L&#039; U R&#039;]&lt;br /&gt;
* [R U&#039; R&#039; U l U F U&#039; R&#039; F&#039; R U&#039; R U l&#039; U R&#039;]&lt;br /&gt;
* [L U&#039; L&#039; U L F U F&#039; L&#039; U&#039; L F&#039; L F L&#039; U L&#039;]&lt;br /&gt;
* [R&#039; U L&#039; U2 R U&#039; L R&#039; U L&#039; U2 R U&#039; L]&lt;br /&gt;
* [R U&#039; L d2 L&#039; U L R&#039; U&#039; R U2 r&#039; F l&#039; U&#039; (y2)]&lt;br /&gt;
* [L U&#039; R U2 L&#039; U R&#039; L U&#039; R U2 L&#039; U R&#039; U&#039;]&lt;br /&gt;
* [R U&#039; R&#039; U l U F U&#039; R&#039; F&#039; R U&#039; R U l&#039; U R&#039;]&lt;br /&gt;
* [R&#039; U R&#039; D R&#039;2 U&#039; R U D&#039; R&#039; D R&#039;2 U&#039; R D&#039;]&lt;br /&gt;
* [R U&#039; L d2 L&#039; U L R&#039; U&#039; R U2 L&#039; U R U&#039;]&lt;br /&gt;
&lt;br /&gt;
-----------------------&lt;br /&gt;
&lt;br /&gt;
== N Permutation : b ==&lt;br /&gt;
&lt;br /&gt;
[[Image:n.gif]]&lt;br /&gt;
&lt;br /&gt;
* [z U&#039; R D&#039; R2&#039; U R&#039;(U&#039;D) R D&#039; R2 U R&#039; D&#039; R&#039;]&lt;br /&gt;
* [L&#039; U R&#039; U2&#039; L U&#039; L&#039; R U R&#039; U2&#039; L U&#039; R U&#039;]&lt;br /&gt;
* [R&#039; U R U&#039; R&#039; F&#039; U&#039; F R U R&#039; F R&#039; F&#039; R U&#039; R]&lt;br /&gt;
* [z U&#039; R D&#039; R2 U R&#039; U&#039; z&#039; R U R&#039; z R2 U R&#039; z&#039; R U&#039;]&lt;br /&gt;
* [L&#039; U R&#039; (z) R2 U R&#039; U (z&#039;) R U R&#039; (z) R2 U R&#039; (z&#039;) R U&#039;]&lt;br /&gt;
* [L&#039; U L U&#039; r&#039; U&#039; F&#039; U L F L&#039; U L&#039; U&#039; r U&#039; L]&lt;br /&gt;
&lt;br /&gt;
-----------------------&lt;br /&gt;
&lt;br /&gt;
== J Permutation : a ==&lt;br /&gt;
&lt;br /&gt;
[[Image:j1.gif]]&lt;br /&gt;
&lt;br /&gt;
* [y2 R&#039; U2 R U R&#039; Z&#039; R2&#039; U R&#039; D R U&#039;]&lt;br /&gt;
* [y2 L&#039; R&#039; U2 R U R&#039; U2 L U&#039; R U ]&lt;br /&gt;
* [y2 F2 L&#039; U&#039; r U2 l&#039; U R&#039; U&#039; R U l U R2 F]&lt;br /&gt;
* [y2 R&#039; U2 R U R&#039; U2&#039; L U&#039; R U L&#039;]&lt;br /&gt;
* [R U&#039; L&#039; U R&#039; U2 L U&#039; L&#039; U2&#039; L]&lt;br /&gt;
* [R L d2 R&#039; U&#039; R d2 R&#039; U L&#039;]&lt;br /&gt;
* [(L&#039; U R&#039; U2 L U&#039; R) U (L&#039; U R&#039; U2 L U&#039; R)]&lt;br /&gt;
* [L&#039; U R&#039; U2 L U&#039; R U L&#039; U R&#039; U2 L U&#039; R]&lt;br /&gt;
* [L&#039; U2 L U L&#039; U2 R U&#039; L U R&#039;]&lt;br /&gt;
-----------------------&lt;br /&gt;
&lt;br /&gt;
== J Permutation : b ==&lt;br /&gt;
&lt;br /&gt;
[[Image:j.gif]]&lt;br /&gt;
&lt;br /&gt;
* [R U2 R&#039; U&#039; R U2 L&#039; U R&#039; U&#039; L]&lt;br /&gt;
* [y2 R L U2 L&#039; U&#039; L U2 R&#039; U L&#039; U&#039;]&lt;br /&gt;
* [R U R&#039; F&#039; - R U R&#039; U&#039; R&#039;-F-R2 U&#039; R&#039; U&#039;]&lt;br /&gt;
* [(y2) F2&#039; R U R&#039; (y) r2 (y&#039;) R U&#039; R U R2&#039;]&lt;br /&gt;
* [L&#039; U R U&#039; L U2 R&#039; U R U2&#039; R&#039;]&lt;br /&gt;
* [(y2) r2 U&#039; L&#039; U r&#039; U2 R B&#039; R&#039; U2]&lt;br /&gt;
* [(R U&#039; L U2 R&#039; U L) U&#039; (R U&#039; L U2 R&#039; U L)]&lt;br /&gt;
* L&#039; U R&#039; U2 L U&#039; L&#039; U2 R L]&lt;br /&gt;
&lt;br /&gt;
-----------------------&lt;br /&gt;
&lt;br /&gt;
== H Permutation ==&lt;br /&gt;
&lt;br /&gt;
[[Image:h.gif]]&lt;br /&gt;
&lt;br /&gt;
* [M2 U&#039; M2 U2&#039; M2 U&#039; M2]&lt;br /&gt;
* [R2&#039; r2 U&#039; L2 l2&#039; U2 R2&#039; r2 U&#039; L2 l2&#039;]&lt;br /&gt;
* [U&#039; M2 U2 M2 U M2 U2 M2]&lt;br /&gt;
* [F2 M2 F2 U&#039; F2 M2 F2 U]&lt;br /&gt;
* [(x) U2 M2 U2 B&#039; U2 M2 U2 B]&lt;br /&gt;
* [R2 U2 R2 U2 R2 U R2 U2 R2 U2 R2 U&#039;]&lt;br /&gt;
* [L R U2 L&#039; R&#039; F&#039; B&#039; U2 F B]&lt;br /&gt;
* [L R U2 x U&#039; D&#039; x&#039; y U2 L R]&lt;br /&gt;
* [R U2 R&#039; U&#039; R&#039; U&#039; R2 U&#039; R2 U2 R2 U2 R&#039; U]&lt;br /&gt;
* [R2 U2 R U2 R2 U2 R2 U2 R U2 R2]&lt;br /&gt;
&lt;br /&gt;
-----------------------&lt;br /&gt;
&lt;br /&gt;
== G Permutation : a ==&lt;br /&gt;
&lt;br /&gt;
[[Image:g3.gif]]&lt;br /&gt;
&lt;br /&gt;
* [R2&#039; u R&#039; U R&#039; U&#039; R u&#039; R2 y&#039; R&#039; U R]&lt;br /&gt;
* [y R2 D B&#039; U B&#039; U&#039; B D&#039; R2 F&#039; U F]&lt;br /&gt;
&lt;br /&gt;
-----------------------&lt;br /&gt;
&lt;br /&gt;
== G Permutation : b ==&lt;br /&gt;
&lt;br /&gt;
[[Image:g2.gif]]&lt;br /&gt;
&lt;br /&gt;
* [y L&#039; U&#039; L y&#039; R2&#039; u R&#039; U R U&#039; R u&#039; R2]&lt;br /&gt;
* [R&#039; U&#039; R B2 D L&#039; U L U&#039; L D&#039; B2]&lt;br /&gt;
&lt;br /&gt;
-----------------------&lt;br /&gt;
&lt;br /&gt;
== G Permutation : c ==&lt;br /&gt;
&lt;br /&gt;
[[Image:g1.gif]]&lt;br /&gt;
&lt;br /&gt;
* [y R2&#039; u&#039; R U&#039; R U R&#039; u R2 B U&#039; B&#039;]&lt;br /&gt;
* [R U R&#039; F2 D&#039; L U&#039; L&#039; U L&#039; D F2]&lt;br /&gt;
&lt;br /&gt;
-----------------------&lt;br /&gt;
&lt;br /&gt;
== G Permutation : d ==&lt;br /&gt;
&lt;br /&gt;
[[Image:g.gif]]&lt;br /&gt;
&lt;br /&gt;
* [y LU&#039;RU2L&#039;UR&#039;y (R&#039;L&#039;)U2(RL)]&lt;br /&gt;
* [y&#039; (R&#039;F&#039;RF&#039;)(U&#039;L&#039;U)(FR&#039;F&#039;LF2R)]&lt;br /&gt;
* [F2 D&#039; L U&#039; L U L&#039; D F2 R U&#039; R&#039;]&lt;br /&gt;
* [(l&#039; U&#039; U&#039; L&#039; U l F&#039;) (U&#039; L U F R&#039; F R)][&lt;br /&gt;
&lt;br /&gt;
-----------------------&lt;br /&gt;
&lt;br /&gt;
== F Permutation ==&lt;br /&gt;
&lt;br /&gt;
[[Image:f.gif]]&lt;br /&gt;
&lt;br /&gt;
* [R U&#039; R&#039; U R2 y R U R&#039; U&#039; x U&#039; R&#039; U R U2]&lt;br /&gt;
* [yz R U R&#039; U&#039; R U2 z&#039; y&#039; R U R&#039; U&#039; y x L&#039; U&#039; L U L2 x&#039;]&lt;br /&gt;
* [R&#039; U R U&#039; R2 F&#039; U&#039; F U x R U R&#039; U&#039; R2 B&#039;]&lt;br /&gt;
* [R&#039; U R U&#039; R2&#039; F&#039; U&#039; F U R U&#039; x&#039; R2 U&#039; R&#039; U]&lt;br /&gt;
* [y R U R&#039; U R U2 R2 U&#039; R U&#039; R&#039; U2 R U r U R&#039; U&#039; L&#039; U R U&#039;]&lt;br /&gt;
* [R&#039; U2 R&#039; d&#039; R&#039; F&#039; R2 U&#039; R&#039; U R&#039; F R U&#039; F]&lt;br /&gt;
&lt;br /&gt;
-----------------------&lt;br /&gt;
&lt;br /&gt;
== E Permutation ==&lt;br /&gt;
&lt;br /&gt;
[[Image:e.gif]]&lt;br /&gt;
&lt;br /&gt;
* [z2 y x R U&#039; R&#039; D R U R&#039; D2 L&#039; U L D L&#039; U&#039; L]&lt;br /&gt;
* [x U R&#039; U&#039; L U R U&#039;-R2 w&#039; U&#039; R U L U&#039; R&#039;U]&lt;br /&gt;
* [y x R U&#039; R&#039; D R U R&#039; u2 R&#039; U R D R&#039; U&#039; R]&lt;br /&gt;
* [l&#039; U&#039; L&#039; U R U&#039; l U R&#039; U&#039; L U R U&#039; l&#039; U]&lt;br /&gt;
* [(r&#039; R&#039; U&#039;) (L D&#039; L&#039; U L) (R U&#039; R&#039; D R) U]&lt;br /&gt;
* [r2 U r2 D x&#039; (RU&#039;R&#039;U)*3 x D&#039; r2 U&#039; r2]&lt;br /&gt;
* [x&#039; U&#039; R U L&#039; U&#039; R&#039; U r2 U R&#039; U&#039; R&#039; F R F&#039;]&lt;br /&gt;
* [y&#039; z&#039; R&#039; F R2 U R&#039; B&#039; R U&#039; R2 F&#039; R z R B R&#039;]&lt;br /&gt;
-----------------------&lt;br /&gt;
&lt;br /&gt;
== A Permutation : a ==&lt;br /&gt;
&lt;br /&gt;
[[Image:a1.gif]]&lt;br /&gt;
&lt;br /&gt;
* [x R&#039; U R&#039; D2 R U&#039; R&#039; D2 R2]&lt;br /&gt;
* [L&#039;BL&#039;-F2LB&#039;L&#039;-F2L2]&lt;br /&gt;
* [y2 z F2 R U2 R&#039; U2 F2 L&#039; U2 L U2]&lt;br /&gt;
* [y z&#039; U2 R U2 R&#039; F2 U2 L&#039; U2 L F2]&lt;br /&gt;
* [R&#039;U2R2U&#039;L&#039;UR&#039;U&#039;LUR&#039;U2R]&lt;br /&gt;
* [(U R&#039; D r2 U&#039;) (R U r2&#039; U&#039;) (D&#039;)]&lt;br /&gt;
&lt;br /&gt;
-----------------------&lt;br /&gt;
&lt;br /&gt;
== A Permutation : b ==&lt;br /&gt;
&lt;br /&gt;
[[Image:a.gif]]&lt;br /&gt;
&lt;br /&gt;
* [y&#039;x R2 D2 R U R&#039; D2 R U&#039; R]&lt;br /&gt;
* [RB&#039;R-F2-R&#039;BR-F2R2]&lt;br /&gt;
* [y z U2 L&#039; U2 L F2 U2 R U2 R&#039; F2]&lt;br /&gt;
* [z&#039; F2 L&#039; U2 L U2 F2 R U2 R&#039; U2]&lt;br /&gt;
* [y&#039; R&#039;U2RU&#039;L&#039;URU&#039;LUR2U2R]&lt;br /&gt;
* [(U&#039; r x) (l2&#039; U L U&#039;) (R&#039; U) (L&#039; U&#039; L&#039;) (R&#039; U)]&lt;br /&gt;
&lt;br /&gt;
-----------------------&lt;br /&gt;
&lt;br /&gt;
== Z Permutation ==&lt;br /&gt;
&lt;br /&gt;
[[Image:z.gif]]&lt;br /&gt;
* [x&#039; R U&#039; R&#039; U D R&#039; D U&#039; R&#039; U R D2&#039; F x]&lt;br /&gt;
* [x M2 U M2 U M&#039; U2 M2 U2 M&#039; U2]&lt;br /&gt;
* [y M2&#039; U&#039; M&#039; U2&#039; M2&#039; U2&#039; M&#039; U M2&#039;]&lt;br /&gt;
* [U R&#039; U&#039; R U&#039; R U R U&#039; R&#039; U R U R2 U&#039; R&#039; U]&lt;br /&gt;
* [R2 U R2 U&#039; R2 F2 R2 U&#039; F2 U R2 F2]&lt;br /&gt;
* [M&#039; U M2 U M2 U M&#039; U2 M2 U&#039;]&lt;br /&gt;
* [y&#039; M2 U2 M&#039; U&#039; M2 U&#039; M2 U&#039; M&#039; U]&lt;br /&gt;
* [R&#039; U L&#039; U2 D2 R U&#039; L R&#039; U L&#039; U2 D2 R U&#039; L]&lt;br /&gt;
* [R&#039; U L&#039; E2 L U&#039; R L&#039; U R&#039; E2 R U&#039; L&#039;]&lt;br /&gt;
* [y R2 U&#039; R2 U R2 x&#039; U2 R2 F U2 F&#039; R2 U2]&lt;br /&gt;
* [M&#039; U M2 U M2 U M&#039; U2 M2 U&#039;]&lt;br /&gt;
* [U&#039; l&#039; U R U&#039; D&#039; R U D&#039; R U&#039; R&#039; D2]&lt;br /&gt;
* [d R U R2 U&#039; R&#039; F R U R U&#039; R U&#039; R&#039; U&#039; R U R&#039; F&#039;&lt;/div&gt;</summary>
		<author><name>Pcharles93</name></author>
	</entry>
	<entry>
		<id>https://www.speedsolving.com/wiki/index.php?title=3x3x3_Speedcubing_Methods&amp;diff=362</id>
		<title>3x3x3 Speedcubing Methods</title>
		<link rel="alternate" type="text/html" href="https://www.speedsolving.com/wiki/index.php?title=3x3x3_Speedcubing_Methods&amp;diff=362"/>
		<updated>2008-08-28T21:37:11Z</updated>

		<summary type="html">&lt;p&gt;Pcharles93: /* Intermediate Methods */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Because of the popularity and relative simplicity of the 3x3x3 cube, there are a large number of methods out there. The most common and fast will be explored in this article.&lt;br /&gt;
&lt;br /&gt;
== Basic Methods ==&lt;br /&gt;
&lt;br /&gt;
Basic methods require very few algorithms and little practice, but they also have a high move count and are very difficult to get fast times with. These methods are good for teaching people who have never solved a Rubik&#039;s Cube before.&lt;br /&gt;
&lt;br /&gt;
In the &#039;&#039;[[Layer-By-Layer]]&#039;&#039; method, the solver finishes the layers one at a time: the first layer, edges then corners; then the second layer edges; and finally the last layer. This is the most common method for new cubers to discover on their own.&lt;br /&gt;
&lt;br /&gt;
In the &#039;&#039;[[Corners First]]&#039;&#039; style, the corners are all solved, and then the edges and centers are filled in. This is a very easy method to learn, and it has many variations.&lt;br /&gt;
&lt;br /&gt;
== Intermediate Methods ==&lt;br /&gt;
&lt;br /&gt;
Intermediate methods are very popular because they are quite fast without requiring extensive knowledge or memorization. They have a moderate move count (although they can be heavily optimized) and are good for cubers who have mastered a basic method.&lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;[[Fridrich Method]]&#039;&#039; is the most popular speedcubing method. First the bottom layer edges are solved, then the first two layers are filled in either using intuition or slotting in each corner edge pair using one of 41 &amp;quot;algorithms&amp;quot;, and finally the top layer is oriented and permuted in seperate steps using one each of 21 PLL&#039;s and 57 OLL&#039;s.&lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;[[ZZ Method]]&#039;&#039; is a variation of Fridrich where the edges are all oriented in the first step, allowing for more fingertricks and fewer cube rotations.&lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;[[Petrus Method]]&#039;&#039; is the second-most popular speedcubing method. The cuber creates a 2x2x2 block and expands it to a 2x2x3 block, then orients all of the remaining edges and finishes the first two layers with U and R turns only. Finally the last layer is finished in three steps. Most Petrus users finish the last layer in two steps using OLL then PLL.&lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;[[MGLS Method]]&#039;&#039; is another way to deal with the transition between F2L and LL. After the F2L minus a corner-edge pair has been created (this first part can be done with Fridrich, Petrus, Heise, etc.), there are three algorithmic steps: insert the F2L edge and orient the LL edges, insert the F2L corner and orient the LL corners, and then [[PLL]].&lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;[[Roux Method]]&#039;&#039; is a hybrid block-building and corners first method. Two opposite 1x2x3 blocks are made; then, the last four corners are solved, and the last six edges are finished off intuitively.&lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;[[Waterman Method]]&#039;&#039; is an efficient method based on corners first methods. The cuber first finishes the first layer, then does the opposite layer&#039;s corners, and finally finishes the remaining edges in three steps.&lt;br /&gt;
&lt;br /&gt;
== Advanced Methods ==&lt;br /&gt;
&lt;br /&gt;
An advanced method requires extensive memorization, understanding of intuitive blockbuilding, or both. Few people have ever mastered these methods, but they are capable of extremely low move counts and times.&lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;[[Heise Method]]&#039;&#039; is a very tricky block-building method that requires no algorithms at all. Four 1x2x2 blocks are created, and then paired up to finish all of the F2L minus two pieces, while also orienting the last layer edges. Then two corner-edge pairs are made and all of the edges are solved along with two corners. Finally the three remaining corners are finished with a commutator.&lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;[[ZB Method]]&#039;&#039; is an extension of Fridrich which requires hundreds of lengthy algorithms. After solving the F2L minus a corner-edge pair, the cube is finished in two algorithms: first the cuber finishes the F2L while orienting the LL edges, and then the cuber solves the entire LL in one step.&lt;/div&gt;</summary>
		<author><name>Pcharles93</name></author>
	</entry>
	<entry>
		<id>https://www.speedsolving.com/wiki/index.php?title=3x3x3_Speedcubing_Methods&amp;diff=361</id>
		<title>3x3x3 Speedcubing Methods</title>
		<link rel="alternate" type="text/html" href="https://www.speedsolving.com/wiki/index.php?title=3x3x3_Speedcubing_Methods&amp;diff=361"/>
		<updated>2008-08-28T21:36:52Z</updated>

		<summary type="html">&lt;p&gt;Pcharles93: /* Intermediate Methods */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Because of the popularity and relative simplicity of the 3x3x3 cube, there are a large number of methods out there. The most common and fast will be explored in this article.&lt;br /&gt;
&lt;br /&gt;
== Basic Methods ==&lt;br /&gt;
&lt;br /&gt;
Basic methods require very few algorithms and little practice, but they also have a high move count and are very difficult to get fast times with. These methods are good for teaching people who have never solved a Rubik&#039;s Cube before.&lt;br /&gt;
&lt;br /&gt;
In the &#039;&#039;[[Layer-By-Layer]]&#039;&#039; method, the solver finishes the layers one at a time: the first layer, edges then corners; then the second layer edges; and finally the last layer. This is the most common method for new cubers to discover on their own.&lt;br /&gt;
&lt;br /&gt;
In the &#039;&#039;[[Corners First]]&#039;&#039; style, the corners are all solved, and then the edges and centers are filled in. This is a very easy method to learn, and it has many variations.&lt;br /&gt;
&lt;br /&gt;
== Intermediate Methods ==&lt;br /&gt;
&lt;br /&gt;
Intermediate methods are very popular because they are quite fast without requiring extensive knowledge or memorization. They have a moderate move count (although they can be heavily optimized) and are good for cubers who have mastered a basic method.&lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;[[Fridrich Method]]&#039;&#039; is the most popular speedcubing method. First the bottom layer edges are solved, then the first two layers are filled in either using intuition or slotting in each corner edge pair using one of 41 &amp;quot;algorithms&amp;quot;, and finally the top layer is oriented and permuted in seperate steps using one each of 21 PLL&#039;s or 57 OLL&#039;s.&lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;[[ZZ Method]]&#039;&#039; is a variation of Fridrich where the edges are all oriented in the first step, allowing for more fingertricks and fewer cube rotations.&lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;[[Petrus Method]]&#039;&#039; is the second-most popular speedcubing method. The cuber creates a 2x2x2 block and expands it to a 2x2x3 block, then orients all of the remaining edges and finishes the first two layers with U and R turns only. Finally the last layer is finished in three steps. Most Petrus users finish the last layer in two steps using OLL then PLL.&lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;[[MGLS Method]]&#039;&#039; is another way to deal with the transition between F2L and LL. After the F2L minus a corner-edge pair has been created (this first part can be done with Fridrich, Petrus, Heise, etc.), there are three algorithmic steps: insert the F2L edge and orient the LL edges, insert the F2L corner and orient the LL corners, and then [[PLL]].&lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;[[Roux Method]]&#039;&#039; is a hybrid block-building and corners first method. Two opposite 1x2x3 blocks are made; then, the last four corners are solved, and the last six edges are finished off intuitively.&lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;[[Waterman Method]]&#039;&#039; is an efficient method based on corners first methods. The cuber first finishes the first layer, then does the opposite layer&#039;s corners, and finally finishes the remaining edges in three steps.&lt;br /&gt;
&lt;br /&gt;
== Advanced Methods ==&lt;br /&gt;
&lt;br /&gt;
An advanced method requires extensive memorization, understanding of intuitive blockbuilding, or both. Few people have ever mastered these methods, but they are capable of extremely low move counts and times.&lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;[[Heise Method]]&#039;&#039; is a very tricky block-building method that requires no algorithms at all. Four 1x2x2 blocks are created, and then paired up to finish all of the F2L minus two pieces, while also orienting the last layer edges. Then two corner-edge pairs are made and all of the edges are solved along with two corners. Finally the three remaining corners are finished with a commutator.&lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;[[ZB Method]]&#039;&#039; is an extension of Fridrich which requires hundreds of lengthy algorithms. After solving the F2L minus a corner-edge pair, the cube is finished in two algorithms: first the cuber finishes the F2L while orienting the LL edges, and then the cuber solves the entire LL in one step.&lt;/div&gt;</summary>
		<author><name>Pcharles93</name></author>
	</entry>
</feed>