<?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=Jtjogobonito</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=Jtjogobonito"/>
	<link rel="alternate" type="text/html" href="https://www.speedsolving.com/wiki/index.php/Special:Contributions/Jtjogobonito"/>
	<updated>2026-11-02T09:30:51Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.43.8</generator>
	<entry>
		<id>https://www.speedsolving.com/wiki/index.php?title=JTLE&amp;diff=24396</id>
		<title>JTLE</title>
		<link rel="alternate" type="text/html" href="https://www.speedsolving.com/wiki/index.php?title=JTLE&amp;diff=24396"/>
		<updated>2014-08-17T13:14:58Z</updated>

		<summary type="html">&lt;p&gt;Jtjogobonito: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Method Infobox&lt;br /&gt;
|name=JTLE&lt;br /&gt;
|image=JTLE.jpg&lt;br /&gt;
|proposers=John Tamanas&lt;br /&gt;
|year=2009&lt;br /&gt;
|anames=&lt;br /&gt;
|variants=&lt;br /&gt;
|steps=1&lt;br /&gt;
|algs=27&lt;br /&gt;
|moves=10.6 [[HTM]]&lt;br /&gt;
|purpose=&amp;lt;sup&amp;gt;&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[Speedsolving]]&lt;br /&gt;
}}&lt;br /&gt;
A system for orienting last layer corners while simultaneously placing the final DR edge. It is used in conjunction with methods which pre-orient LL edges (such as [[ZZ]] or [[Petrus]]).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== JTLE solve procedure ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Petrus]]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 1:&#039;&#039;&#039; 2x2x2 block&lt;br /&gt;
&lt;br /&gt;
The first step is exactly the same as the first step of normal Petrus.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 2:&#039;&#039;&#039; Expand to 2x2x3&lt;br /&gt;
&lt;br /&gt;
The second step is exactly the same as the second step of normal Petrus.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 3:&#039;&#039;&#039; EO&lt;br /&gt;
&lt;br /&gt;
The third step is exactly the same as the third step of normal Petrus.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 4:&#039;&#039;&#039; Pseudo-F2L&lt;br /&gt;
&lt;br /&gt;
Solve the [[F2L]] without the DF edge piece.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 5:&#039;&#039;&#039; Edge and orient Last Layer Corners ([[ELLC]], for short)&lt;br /&gt;
&lt;br /&gt;
This step inserts the missing cross piece(Solving DR)and orients the LL corners. There are only 27 algorithms for this step; they are listed below.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 6:&#039;&#039;&#039; [[PLL]]&lt;br /&gt;
&lt;br /&gt;
[[PLL]] is just [[PLL]].&lt;br /&gt;
&lt;br /&gt;
________________________________&lt;br /&gt;
&lt;br /&gt;
[[ZZ]]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 1:&#039;&#039;&#039; EOLine&lt;br /&gt;
&lt;br /&gt;
In this step the solver will orient all edges(For more information on edge orientation please click here.) and solve the DF and DB.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 2:&#039;&#039;&#039; Pseudo-F2L&lt;br /&gt;
&lt;br /&gt;
The solver will solve [[F2L]] using only R, U , and L moves. This is exactly the same as ZZ. Remember, that the DR edge is not permanent; so you can save moves by placing another OD (opposite of D) edge in the DR spot.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 3:&#039;&#039;&#039; Edge and orient Last Layer Corners ([[ELLC]], for short)&lt;br /&gt;
&lt;br /&gt;
This step inserts the missing cross piece(Solving DR)and orients the LL corners. There are only 27 algorithms for this step; they are listed below.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 4:&#039;&#039;&#039; [[PLL]]&lt;br /&gt;
&lt;br /&gt;
[[PLL]] is just [[PLL]].&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Example Solve ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;scramble (F2L on D):&#039;&#039;&#039; U2 L2 D2 B&#039; D2 R2 F U2 B2 U2 B&#039; R F R&#039; D&#039; B&#039; R&#039; D&#039; L U2&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Pseudo x-cross:&#039;&#039;&#039; B L R U2 R&#039; U2 R2 y&#039; (7)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;2x2x3:&#039;&#039;&#039; R U&#039; R&#039; U&#039; L&#039; U&#039; L (7)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Last 2 slots:&#039;&#039;&#039; U&#039; R2 U&#039; R2 U2 R U2 R2 (8)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Pseudo ELLC:&#039;&#039;&#039; U&#039; R U2 R2 U&#039; R&#039; U&#039; R2 U2 R (10)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Finish F2L and EOLL:&#039;&#039;&#039; D M U M&#039; D&#039; (5)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;PLL:&#039;&#039;&#039; N perm&lt;br /&gt;
&lt;br /&gt;
Total: 37 moves to PLL&lt;br /&gt;
== See also ==&lt;br /&gt;
* [[Advanced F2L]]&lt;br /&gt;
&lt;br /&gt;
== External links ==&lt;br /&gt;
* [http://www.physics.rutgers.edu/~jtamanas/cube/JTLE.html JTLE algs]&lt;br /&gt;
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?t=14944 JTLE - does it have potential?]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category:3x3x3 other substeps]]&lt;br /&gt;
[[Category:Acronyms]]&lt;/div&gt;</summary>
		<author><name>Jtjogobonito</name></author>
	</entry>
	<entry>
		<id>https://www.speedsolving.com/wiki/index.php?title=JTLE&amp;diff=24369</id>
		<title>JTLE</title>
		<link rel="alternate" type="text/html" href="https://www.speedsolving.com/wiki/index.php?title=JTLE&amp;diff=24369"/>
		<updated>2014-08-11T14:39:10Z</updated>

		<summary type="html">&lt;p&gt;Jtjogobonito: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Method Infobox&lt;br /&gt;
|name=JTLE&lt;br /&gt;
|image=JTLE.jpg&lt;br /&gt;
|proposers=John Tamanas&lt;br /&gt;
|year=2009&lt;br /&gt;
|anames=&lt;br /&gt;
|variants=&lt;br /&gt;
|steps=1&lt;br /&gt;
|algs=27&lt;br /&gt;
|moves=10.6 [[HTM]]&lt;br /&gt;
|purpose=&amp;lt;sup&amp;gt;&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[Speedsolving]]&lt;br /&gt;
}}&lt;br /&gt;
A system for orienting last layer corners while simultaneously placing the final DR edge. It is used in conjunction with methods which pre-orient LL edges (such as [[ZZ]] or [[Petrus]]).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== JTLE solve procedure ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Petrus]]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 1:&#039;&#039;&#039; 2x2x2 block&lt;br /&gt;
&lt;br /&gt;
The first step is exactly the same as the first step of normal Petrus.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 2:&#039;&#039;&#039; Expand to 2x2x3&lt;br /&gt;
&lt;br /&gt;
The second step is exactly the same as the second step of normal Petrus.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 3:&#039;&#039;&#039; EO&lt;br /&gt;
&lt;br /&gt;
The third step is exactly the same as the third step of normal Petrus.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 4:&#039;&#039;&#039; Pseudo-F2L&lt;br /&gt;
&lt;br /&gt;
Solve the [[F2L]] without the DF edge piece.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 5:&#039;&#039;&#039; Edge and orient Last Layer Corners ([[ELLC]], for short)&lt;br /&gt;
&lt;br /&gt;
This step inserts the missing cross piece(Solving DR)and orients the LL corners. There are only 27 algorithms for this step; they are listed below.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 6:&#039;&#039;&#039; [[PLL]]&lt;br /&gt;
&lt;br /&gt;
[[PLL]] is just [[PLL]].&lt;br /&gt;
&lt;br /&gt;
________________________________&lt;br /&gt;
&lt;br /&gt;
[[ZZ]]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 1:&#039;&#039;&#039; EOLine&lt;br /&gt;
&lt;br /&gt;
In this step the solver will orient all edges(For more information on edge orientation please click here.) and solve the DF and DB.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 2:&#039;&#039;&#039; Pseudo-F2L&lt;br /&gt;
&lt;br /&gt;
The solver will solve [[F2L]] using only R, U , and L moves. This is exactly the same as ZZ. Remember, that the DR edge is not permanent; so you can save moves by placing another OD (opposite of D) edge in the DR spot.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 3:&#039;&#039;&#039; Edge and orient Last Layer Corners ([[ELLC]], for short)&lt;br /&gt;
&lt;br /&gt;
This step inserts the missing cross piece(Solving DR)and orients the LL corners. There are only 27 algorithms for this step; they are listed below.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 4:&#039;&#039;&#039; [[PLL]]&lt;br /&gt;
&lt;br /&gt;
[[PLL]] is just [[PLL]].&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Example Solve ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;scramble (F2L on D):&#039;&#039;&#039; U2 L2 D2 B&#039; D2 R2 F U2 B2 U2 B&#039; R F R&#039; D&#039; B&#039; R&#039; D&#039; L U2&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Pseudo x-cross:&#039;&#039;&#039; B L R U2 R&#039; U2 R2 y&#039; (7)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;2x2x3:&#039;&#039;&#039; R U&#039; R&#039; U&#039; L&#039; U&#039; L (7)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Last 2 slots:&#039;&#039;&#039; U&#039; R2 U&#039; R2 U2 R U2 R2 (8)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Pseudo ELLC:&#039;&#039;&#039; U&#039; R U2 R2 U&#039; R&#039; U&#039; R2 U2 R (10)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Finish F2L and EOLL:&#039;&#039;&#039; D M U M&#039; D&#039; (5)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;PLL:&#039;&#039;&#039; N perm&lt;br /&gt;
&lt;br /&gt;
Total: 37 moves to PLL&lt;br /&gt;
== See also ==&lt;br /&gt;
* [[Advanced F2L]]&lt;br /&gt;
&lt;br /&gt;
== External links ==&lt;br /&gt;
* [http://www.physics.rutgers.edu/~jtamanas/cubing/JTLE/JTLE.html JTLE algs]&lt;br /&gt;
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?t=14944 JTLE - does it have potential?]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category:3x3x3 other substeps]]&lt;br /&gt;
[[Category:Acronyms]]&lt;/div&gt;</summary>
		<author><name>Jtjogobonito</name></author>
	</entry>
	<entry>
		<id>https://www.speedsolving.com/wiki/index.php?title=JTLE&amp;diff=24368</id>
		<title>JTLE</title>
		<link rel="alternate" type="text/html" href="https://www.speedsolving.com/wiki/index.php?title=JTLE&amp;diff=24368"/>
		<updated>2014-08-11T14:01:17Z</updated>

		<summary type="html">&lt;p&gt;Jtjogobonito: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Method Infobox&lt;br /&gt;
|name=JTLE&lt;br /&gt;
|image=JTLE.jpg&lt;br /&gt;
|proposers=John Tamanas&lt;br /&gt;
|year=2009&lt;br /&gt;
|anames=&lt;br /&gt;
|variants=&lt;br /&gt;
|steps=1&lt;br /&gt;
|algs=27&lt;br /&gt;
|moves=10.6 [[HTM]]&lt;br /&gt;
|purpose=&amp;lt;sup&amp;gt;&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[Speedsolving]]&lt;br /&gt;
}}&lt;br /&gt;
A system for orienting last layer corners while simultaneously placing the final DR edge. It is used in conjunction with methods which pre-orient LL edges (such as [[ZZ]] or [[Petrus]]).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== JTLE solve procedure ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Petrus]]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 1:&#039;&#039;&#039; 2x2x2 block&lt;br /&gt;
&lt;br /&gt;
The first step is exactly the same as the first step of normal Petrus.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 2:&#039;&#039;&#039; Expand to 2x2x3&lt;br /&gt;
&lt;br /&gt;
The second step is exactly the same as the second step of normal Petrus.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 3:&#039;&#039;&#039; EO&lt;br /&gt;
&lt;br /&gt;
The third step is exactly the same as the third step of normal Petrus.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 4:&#039;&#039;&#039; Pseudo-F2L&lt;br /&gt;
&lt;br /&gt;
Solve the [[F2L]] without the DF edge piece.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 5:&#039;&#039;&#039; Edge and orient Last Layer Corners ([[ELLC]], for short)&lt;br /&gt;
&lt;br /&gt;
This step inserts the missing cross piece(Solving DR)and orients the LL corners. There are only 27 algorithms for this step; they are listed below.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 6:&#039;&#039;&#039; [[PLL]]&lt;br /&gt;
&lt;br /&gt;
[[PLL]] is just [[PLL]].&lt;br /&gt;
&lt;br /&gt;
________________________________&lt;br /&gt;
&lt;br /&gt;
[[ZZ]]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 1:&#039;&#039;&#039; EOLine&lt;br /&gt;
&lt;br /&gt;
In this step the solver will orient all edges(For more information on edge orientation please click here.) and solve the DF and DB.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 2:&#039;&#039;&#039; Pseudo-F2L&lt;br /&gt;
&lt;br /&gt;
The solver will solve [[F2L]] using only R, U , and L moves. This is exactly the same as ZZ. Remember, that the DR edge is not permanent; so you can save moves by placing another OD (opposite of D) edge in the DR spot.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 3:&#039;&#039;&#039; Edge and orient Last Layer Corners ([[ELLC]], for short)&lt;br /&gt;
&lt;br /&gt;
This step inserts the missing cross piece(Solving DR)and orients the LL corners. There are only 27 algorithms for this step; they are listed below.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 4:&#039;&#039;&#039; [[PLL]]&lt;br /&gt;
&lt;br /&gt;
[[PLL]] is just [[PLL]].&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Example Solve ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;scramble (F2L on D):&#039;&#039;&#039; U2 L2 D2 B&#039; D2 R2 F U2 B2 U2 B&#039; R F R&#039; D&#039; B&#039; R&#039; D&#039; L U2&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Pseudo x-cross:&#039;&#039;&#039; B L R U2 R&#039; U2 R2 y&#039; (7)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;2x2x3:&#039;&#039;&#039; R U&#039; R&#039; U&#039; L&#039; U&#039; L (7)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Last 2 slots:&#039;&#039;&#039; U&#039; R2 U&#039; R2 U2 R U2 R2 (8)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Pseudo ELLC:&#039;&#039;&#039; U&#039; R U2 R2 U&#039; R&#039; U&#039; R2 U2 R (10)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Finish F2L and EOLL:&#039;&#039;&#039; y U M&#039; U M (4)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;PLL:&#039;&#039;&#039; N perm&lt;br /&gt;
&lt;br /&gt;
Total: 36 moves to PLL&lt;br /&gt;
== See also ==&lt;br /&gt;
* [[Advanced F2L]]&lt;br /&gt;
&lt;br /&gt;
== External links ==&lt;br /&gt;
* [http://www.physics.rutgers.edu/~jtamanas/cubing/JTLE/JTLE.html JTLE algs]&lt;br /&gt;
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?t=14944 JTLE - does it have potential?]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category:3x3x3 other substeps]]&lt;br /&gt;
[[Category:Acronyms]]&lt;/div&gt;</summary>
		<author><name>Jtjogobonito</name></author>
	</entry>
	<entry>
		<id>https://www.speedsolving.com/wiki/index.php?title=JTLE&amp;diff=24367</id>
		<title>JTLE</title>
		<link rel="alternate" type="text/html" href="https://www.speedsolving.com/wiki/index.php?title=JTLE&amp;diff=24367"/>
		<updated>2014-08-11T14:00:21Z</updated>

		<summary type="html">&lt;p&gt;Jtjogobonito: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Method Infobox&lt;br /&gt;
|name=JTLE&lt;br /&gt;
|image=JTLE.jpg&lt;br /&gt;
|proposers=John Tamanas&lt;br /&gt;
|year=2009&lt;br /&gt;
|anames=&lt;br /&gt;
|variants=&lt;br /&gt;
|steps=1&lt;br /&gt;
|algs=27&lt;br /&gt;
|moves=10.6 [[HTM]]&lt;br /&gt;
|purpose=&amp;lt;sup&amp;gt;&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[Speedsolving]]&lt;br /&gt;
}}&lt;br /&gt;
A system for orienting last layer corners while simultaneously placing the final DR edge. It is used in conjunction with methods which pre-orient LL edges (such as [[ZZ]] or [[Petrus]]).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== JTLE solve procedure ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Petrus]]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 1:&#039;&#039;&#039; 2x2x2 block&lt;br /&gt;
&lt;br /&gt;
The first step is exactly the same as the first step of normal Petrus.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 2:&#039;&#039;&#039; Expand to 2x2x3&lt;br /&gt;
&lt;br /&gt;
The second step is exactly the same as the second step of normal Petrus.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 3:&#039;&#039;&#039; EO&lt;br /&gt;
&lt;br /&gt;
The third step is exactly the same as the third step of normal Petrus.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 4:&#039;&#039;&#039; Pseudo-F2L&lt;br /&gt;
&lt;br /&gt;
Solve the [[F2L]] without the DF edge piece.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 5:&#039;&#039;&#039; Edge and orient Last Layer Corners ([[ELLC]], for short)&lt;br /&gt;
&lt;br /&gt;
This step inserts the missing cross piece(Solving DR)and orients the LL corners. There are only 27 algorithms for this step; they are listed below.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 6:&#039;&#039;&#039; [[PLL]]&lt;br /&gt;
&lt;br /&gt;
[[PLL]] is just [[PLL]].&lt;br /&gt;
&lt;br /&gt;
________________________________&lt;br /&gt;
&lt;br /&gt;
[[ZZ]]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 1:&#039;&#039;&#039; EOLine&lt;br /&gt;
&lt;br /&gt;
In this step the solver will orient all edges(For more information on edge orientation please click here.) and solve the DF and DB.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 2:&#039;&#039;&#039; Pseudo-F2L&lt;br /&gt;
&lt;br /&gt;
The solver will solve [[F2L]] using only R, U , and L moves. This is exactly the same as ZZ. Remember, that the DR edge is not permanent; so you can save moves by placing another OD (opposite of D) edge in the DR spot.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 3:&#039;&#039;&#039; Edge and orient Last Layer Corners ([[ELLC]], for short)&lt;br /&gt;
&lt;br /&gt;
This step inserts the missing cross piece(Solving DR)and orients the LL corners. There are only 27 algorithms for this step; they are listed below.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 4:&#039;&#039;&#039; [[PLL]]&lt;br /&gt;
&lt;br /&gt;
[[PLL]] is just [[PLL]].&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Example Solve ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;scramble (F2L on D):&#039;&#039;&#039; U2 L2 D2 B&#039; D2 R2 F U2 B2 U2 B&#039; R F R&#039; D&#039; B&#039; R&#039; D&#039; L U2&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Pseudo x-cross:&#039;&#039;&#039; B L R U2 R&#039; U2 R2 y&#039; (7)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;F2L 2:&#039;&#039;&#039; R U&#039; R&#039; U&#039; L&#039; U&#039; L (7)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Last 2 slots:&#039;&#039;&#039; U&#039; R2 U&#039; R2 U2 R U2 R2 (8)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Pseudo ELLC:&#039;&#039;&#039; U&#039; R U2 R2 U&#039; R&#039; U&#039; R2 U2 R (10)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Finish F2L and EOLL:&#039;&#039;&#039; y U M&#039; U M (4)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;PLL:&#039;&#039;&#039; N perm&lt;br /&gt;
&lt;br /&gt;
Total: 36 moves to PLL&lt;br /&gt;
== See also ==&lt;br /&gt;
* [[Advanced F2L]]&lt;br /&gt;
&lt;br /&gt;
== External links ==&lt;br /&gt;
* [http://www.physics.rutgers.edu/~jtamanas/cubing/JTLE/JTLE.html JTLE algs]&lt;br /&gt;
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?t=14944 JTLE - does it have potential?]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category:3x3x3 other substeps]]&lt;br /&gt;
[[Category:Acronyms]]&lt;/div&gt;</summary>
		<author><name>Jtjogobonito</name></author>
	</entry>
	<entry>
		<id>https://www.speedsolving.com/wiki/index.php?title=JTLE&amp;diff=24366</id>
		<title>JTLE</title>
		<link rel="alternate" type="text/html" href="https://www.speedsolving.com/wiki/index.php?title=JTLE&amp;diff=24366"/>
		<updated>2014-08-11T03:39:29Z</updated>

		<summary type="html">&lt;p&gt;Jtjogobonito: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Method Infobox&lt;br /&gt;
|name=JTLE&lt;br /&gt;
|image=JTLE.jpg&lt;br /&gt;
|proposers=John Tamanas&lt;br /&gt;
|year=2009&lt;br /&gt;
|anames=&lt;br /&gt;
|variants=&lt;br /&gt;
|steps=1&lt;br /&gt;
|algs=27&lt;br /&gt;
|moves=10.6 [[HTM]]&lt;br /&gt;
|purpose=&amp;lt;sup&amp;gt;&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[Speedsolving]]&lt;br /&gt;
}}&lt;br /&gt;
A system for orienting last layer corners while simultaneously placing the final DR edge. It is used in conjunction with methods which pre-orient LL edges (such as [[ZZ]] or [[Petrus]]).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== JTLE solve procedure: ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Petrus]]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 1:&#039;&#039;&#039; 2x2x2 block&lt;br /&gt;
&lt;br /&gt;
The first step is exactly the same as the first step of normal Petrus.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 2:&#039;&#039;&#039; Expand to 2x2x3&lt;br /&gt;
&lt;br /&gt;
The second step is exactly the same as the second step of normal Petrus.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 3:&#039;&#039;&#039; EO&lt;br /&gt;
&lt;br /&gt;
The third step is exactly the same as the third step of normal Petrus.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 4:&#039;&#039;&#039; Pseudo-F2L&lt;br /&gt;
&lt;br /&gt;
Solve the [[F2L]] without the DF edge piece.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 5:&#039;&#039;&#039; Edge and orient Last Layer Corners ([[ELLC]], for short)&lt;br /&gt;
&lt;br /&gt;
This step inserts the missing cross piece(Solving DR)and orients the LL corners. There are only 27 algorithms for this step; they are listed below.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 6:&#039;&#039;&#039; [[PLL]]&lt;br /&gt;
&lt;br /&gt;
[[PLL]] is just [[PLL]].&lt;br /&gt;
&lt;br /&gt;
________________________________&lt;br /&gt;
&lt;br /&gt;
[[ZZ]]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 1:&#039;&#039;&#039; EOLine&lt;br /&gt;
&lt;br /&gt;
In this step the solver will orient all edges(For more information on edge orientation please click here.) and solve the DF and DB.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 2:&#039;&#039;&#039; Pseudo-F2L&lt;br /&gt;
&lt;br /&gt;
The solver will solve [[F2L]] using only R, U , and L moves. This is exactly the same as ZZ. Remember, that the DR edge is not permanent; so you can save moves by placing another OD (opposite of D) edge in the DR spot.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 3:&#039;&#039;&#039; Edge and orient Last Layer Corners ([[ELLC]], for short)&lt;br /&gt;
&lt;br /&gt;
This step inserts the missing cross piece(Solving DR)and orients the LL corners. There are only 27 algorithms for this step; they are listed below.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 4:&#039;&#039;&#039; [[PLL]]&lt;br /&gt;
&lt;br /&gt;
[[PLL]] is just [[PLL]].&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Example Solve ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;scramble (F2L on D):&#039;&#039;&#039; U2 L2 D2 B&#039; D2 R2 F U2 B2 U2 B&#039; R F R&#039; D&#039; B&#039; R&#039; D&#039; L U2&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Pseudo x-cross:&#039;&#039;&#039; B L R U2 R&#039; U2 R2 y&#039; (7)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;F2L 2:&#039;&#039;&#039; R U&#039; R&#039; U&#039; L&#039; U&#039; L (7)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Last 2 slots:&#039;&#039;&#039; U&#039; R2 U&#039; R2 U2 R U2 R2 (8)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Pseudo ELLC:&#039;&#039;&#039; U&#039; R U2 R2 U&#039; R&#039; U&#039; R2 U2 R (10)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Finish F2L and EOLL:&#039;&#039;&#039; y U M&#039; U M (4)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;PLL:&#039;&#039;&#039; N perm&lt;br /&gt;
&lt;br /&gt;
Total: 36 moves to PLL&lt;br /&gt;
== See also ==&lt;br /&gt;
* [[Advanced F2L]]&lt;br /&gt;
&lt;br /&gt;
== External links ==&lt;br /&gt;
* [http://www.physics.rutgers.edu/~jtamanas/cubing/JTLE/JTLE.html JTLE algs]&lt;br /&gt;
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?t=14944 JTLE - does it have potential?]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category:3x3x3 other substeps]]&lt;br /&gt;
[[Category:Acronyms]]&lt;/div&gt;</summary>
		<author><name>Jtjogobonito</name></author>
	</entry>
	<entry>
		<id>https://www.speedsolving.com/wiki/index.php?title=JTLE&amp;diff=24365</id>
		<title>JTLE</title>
		<link rel="alternate" type="text/html" href="https://www.speedsolving.com/wiki/index.php?title=JTLE&amp;diff=24365"/>
		<updated>2014-08-11T03:39:11Z</updated>

		<summary type="html">&lt;p&gt;Jtjogobonito: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Method Infobox&lt;br /&gt;
|name=JTLE&lt;br /&gt;
|image=JTLE.jpg&lt;br /&gt;
|proposers=John Tamanas&lt;br /&gt;
|year=2009&lt;br /&gt;
|anames=&lt;br /&gt;
|variants=&lt;br /&gt;
|steps=1&lt;br /&gt;
|algs=27&lt;br /&gt;
|moves=10.6 [[HTM]]&lt;br /&gt;
|purpose=&amp;lt;sup&amp;gt;&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[Speedsolving]]&lt;br /&gt;
}}&lt;br /&gt;
A system for orienting last layer corners while simultaneously placing the final DR edge. It is used in conjunction with methods which pre-orient LL edges (such as [[ZZ]] or [[Petrus]]).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== JTLE solve procedure: ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Petrus]]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 1:&#039;&#039;&#039; 2x2x2 block&lt;br /&gt;
&lt;br /&gt;
The first step is exactly the same as the first step of normal Petrus.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 2:&#039;&#039;&#039; Expand to 2x2x3&lt;br /&gt;
&lt;br /&gt;
The second step is exactly the same as the second step of normal Petrus.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 3:&#039;&#039;&#039; EO&lt;br /&gt;
&lt;br /&gt;
The third step is exactly the same as the third step of normal Petrus.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 4:&#039;&#039;&#039; Pseudo-F2L&lt;br /&gt;
&lt;br /&gt;
Solve the [[F2L]] without the DF edge piece.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 5:&#039;&#039;&#039; Edge and orient Last Layer Corners ([[ELLC]], for short)&lt;br /&gt;
&lt;br /&gt;
This step inserts the missing cross piece(Solving DR)and orients the LL corners. There are only 27 algorithms for this step; they are listed below.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 6:&#039;&#039;&#039; [[PLL]]&lt;br /&gt;
&lt;br /&gt;
[[PLL]] is just [[PLL]].&lt;br /&gt;
&lt;br /&gt;
________________________________&lt;br /&gt;
&lt;br /&gt;
[[ZZ]]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 1:&#039;&#039;&#039; EOLine&lt;br /&gt;
&lt;br /&gt;
In this step the solver will orient all edges(For more information on edge orientation please click here.) and solve the DF and DB.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 2:&#039;&#039;&#039; Pseudo-F2L&lt;br /&gt;
&lt;br /&gt;
The solver will solve [[F2L]] using only R, U , and L moves. This is exactly the same as ZZ. Remember, that the DR edge is not permanent; so you can save moves by placing another OD (opposite of D) edge in the DR spot.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 3:&#039;&#039;&#039; Edge and orient Last Layer Corners ([[ELLC]], for short)&lt;br /&gt;
&lt;br /&gt;
This step inserts the missing cross piece(Solving DR)and orients the LL corners. There are only 27 algorithms for this step; they are listed below.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 4:&#039;&#039;&#039; [[PLL]]&lt;br /&gt;
&lt;br /&gt;
[[PLL]] is just [[PLL]].&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Example Solve ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;scramble:&#039;&#039;&#039; U2 L2 D2 B&#039; D2 R2 F U2 B2 U2 B&#039; R F R&#039; D&#039; B&#039; R&#039; D&#039; L U2&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Pseudo x-cross:&#039;&#039;&#039; B L R U2 R&#039; U2 R2 y&#039; (7)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;F2L 2:&#039;&#039;&#039; R U&#039; R&#039; U&#039; L&#039; U&#039; L (7)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Last 2 slots:&#039;&#039;&#039; U&#039; R2 U&#039; R2 U2 R U2 R2 (8)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Pseudo ELLC:&#039;&#039;&#039; U&#039; R U2 R2 U&#039; R&#039; U&#039; R2 U2 R (10)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Finish F2L and EOLL:&#039;&#039;&#039; y U M&#039; U M (4)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;PLL:&#039;&#039;&#039; N perm&lt;br /&gt;
&lt;br /&gt;
Total: 36 moves to PLL&lt;br /&gt;
== See also ==&lt;br /&gt;
* [[Advanced F2L]]&lt;br /&gt;
&lt;br /&gt;
== External links ==&lt;br /&gt;
* [http://www.physics.rutgers.edu/~jtamanas/cubing/JTLE/JTLE.html JTLE algs]&lt;br /&gt;
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?t=14944 JTLE - does it have potential?]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category:3x3x3 other substeps]]&lt;br /&gt;
[[Category:Acronyms]]&lt;/div&gt;</summary>
		<author><name>Jtjogobonito</name></author>
	</entry>
	<entry>
		<id>https://www.speedsolving.com/wiki/index.php?title=JTLE&amp;diff=24364</id>
		<title>JTLE</title>
		<link rel="alternate" type="text/html" href="https://www.speedsolving.com/wiki/index.php?title=JTLE&amp;diff=24364"/>
		<updated>2014-08-11T03:38:30Z</updated>

		<summary type="html">&lt;p&gt;Jtjogobonito: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Method Infobox&lt;br /&gt;
|name=JTLE&lt;br /&gt;
|image=JTLE.jpg&lt;br /&gt;
|proposers=John Tamanas&lt;br /&gt;
|year=2009&lt;br /&gt;
|anames=&lt;br /&gt;
|variants=&lt;br /&gt;
|steps=1&lt;br /&gt;
|algs=27&lt;br /&gt;
|moves=10.6 [[HTM]]&lt;br /&gt;
|purpose=&amp;lt;sup&amp;gt;&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[Speedsolving]]&lt;br /&gt;
}}&lt;br /&gt;
A system for orienting last layer corners while simultaneously placing the final DR edge. It is used in conjunction with methods which pre-orient LL edges (such as [[ZZ]] or [[Petrus]]).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== JTLE solve procedure: ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Petrus]]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 1:&#039;&#039;&#039; 2x2x2 block&lt;br /&gt;
&lt;br /&gt;
The first step is exactly the same as the first step of normal Petrus.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 2:&#039;&#039;&#039; Expand to 2x2x3&lt;br /&gt;
&lt;br /&gt;
The second step is exactly the same as the second step of normal Petrus.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 3:&#039;&#039;&#039; EO&lt;br /&gt;
&lt;br /&gt;
The third step is exactly the same as the third step of normal Petrus.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 4:&#039;&#039;&#039; Pseudo-F2L&lt;br /&gt;
&lt;br /&gt;
Solve the [[F2L]] without the DF edge piece.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 5:&#039;&#039;&#039; Edge and orient Last Layer Corners ([[ELLC]], for short)&lt;br /&gt;
&lt;br /&gt;
This step inserts the missing cross piece(Solving DR)and orients the LL corners. There are only 27 algorithms for this step; they are listed below.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 6:&#039;&#039;&#039; [[PLL]]&lt;br /&gt;
&lt;br /&gt;
[[PLL]] is just [[PLL]].&lt;br /&gt;
&lt;br /&gt;
________________________________&lt;br /&gt;
&lt;br /&gt;
[[ZZ]]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 1:&#039;&#039;&#039; EOLine&lt;br /&gt;
&lt;br /&gt;
In this step the solver will orient all edges(For more information on edge orientation please click here.) and solve the DF and DB.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 2:&#039;&#039;&#039; Pseudo-F2L&lt;br /&gt;
&lt;br /&gt;
The solver will solve [[F2L]] using only R, U , and L moves. This is exactly the same as ZZ. Remember, that the DR edge is not permanent; so you can save moves by placing another OD (opposite of D) edge in the DR spot.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 3:&#039;&#039;&#039; Edge and orient Last Layer Corners ([[ELLC]], for short)&lt;br /&gt;
&lt;br /&gt;
This step inserts the missing cross piece(Solving DR)and orients the LL corners. There are only 27 algorithms for this step; they are listed below.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 4:&#039;&#039;&#039; [[PLL]]&lt;br /&gt;
&lt;br /&gt;
[[PLL]] is just [[PLL]].&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Example Solve ==&lt;br /&gt;
&lt;br /&gt;
scramble: U2 L2 D2 B&#039; D2 R2 F U2 B2 U2 B&#039; R F R&#039; D&#039; B&#039; R&#039; D&#039; L U2&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Pseudo x-cross:&#039;&#039;&#039; B L R U2 R&#039; U2 R2 y&#039; (7)&lt;br /&gt;
&#039;&#039;&#039;F2L 2:&#039;&#039;&#039; R U&#039; R&#039; U&#039; L&#039; U&#039; L (7)&lt;br /&gt;
&#039;&#039;&#039;Last 2 slots:&#039;&#039;&#039; U&#039; R2 U&#039; R2 U2 R U2 R2 (8)&lt;br /&gt;
&#039;&#039;&#039;Pseudo ELLC:&#039;&#039;&#039; U&#039; R U2 R2 U&#039; R&#039; U&#039; R2 U2 R (10)&lt;br /&gt;
&#039;&#039;&#039;Finish F2L and EOLL:&#039;&#039;&#039; y U M&#039; U M (4)&lt;br /&gt;
&#039;&#039;&#039;PLL:&#039;&#039;&#039; N perm&lt;br /&gt;
&lt;br /&gt;
Total: 36 moves to PLL&lt;br /&gt;
== See also ==&lt;br /&gt;
* [[Advanced F2L]]&lt;br /&gt;
&lt;br /&gt;
== External links ==&lt;br /&gt;
* [http://www.physics.rutgers.edu/~jtamanas/cubing/JTLE/JTLE.html JTLE algs]&lt;br /&gt;
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?t=14944 JTLE - does it have potential?]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category:3x3x3 other substeps]]&lt;br /&gt;
[[Category:Acronyms]]&lt;/div&gt;</summary>
		<author><name>Jtjogobonito</name></author>
	</entry>
	<entry>
		<id>https://www.speedsolving.com/wiki/index.php?title=JTLE&amp;diff=24363</id>
		<title>JTLE</title>
		<link rel="alternate" type="text/html" href="https://www.speedsolving.com/wiki/index.php?title=JTLE&amp;diff=24363"/>
		<updated>2014-08-11T03:14:15Z</updated>

		<summary type="html">&lt;p&gt;Jtjogobonito: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Method Infobox&lt;br /&gt;
|name=JTLE&lt;br /&gt;
|image=JTLE.jpg&lt;br /&gt;
|proposers=John Tamanas&lt;br /&gt;
|year=2009&lt;br /&gt;
|anames=&lt;br /&gt;
|variants=&lt;br /&gt;
|steps=1&lt;br /&gt;
|algs=27&lt;br /&gt;
|moves=10.6 [[HTM]]&lt;br /&gt;
|purpose=&amp;lt;sup&amp;gt;&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[Speedsolving]]&lt;br /&gt;
}}&lt;br /&gt;
A system for orienting last layer corners while simultaneously placing the final DR edge. It is used in conjunction with methods which pre-orient LL edges (such as [[ZZ]] or [[Petrus]]).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== JTLE solve procedure: ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Petrus]]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 1:&#039;&#039;&#039; 2x2x2 block&lt;br /&gt;
&lt;br /&gt;
The first step is exactly the same as the first step of normal Petrus.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 2:&#039;&#039;&#039; Expand to 2x2x3&lt;br /&gt;
&lt;br /&gt;
The second step is exactly the same as the second step of normal Petrus.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 3:&#039;&#039;&#039; EO&lt;br /&gt;
&lt;br /&gt;
The third step is exactly the same as the third step of normal Petrus.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 4:&#039;&#039;&#039; Pseudo-F2L&lt;br /&gt;
&lt;br /&gt;
Solve the [[F2L]] without the DF edge piece.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 5:&#039;&#039;&#039; Edge and orient Last Layer Corners ([[ELLC]], for short)&lt;br /&gt;
&lt;br /&gt;
This step inserts the missing cross piece(Solving DR)and orients the LL corners. There are only 27 algorithms for this step; they are listed below.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 6:&#039;&#039;&#039; [[PLL]]&lt;br /&gt;
&lt;br /&gt;
[[PLL]] is just [[PLL]].&lt;br /&gt;
&lt;br /&gt;
________________________________&lt;br /&gt;
&lt;br /&gt;
[[ZZ]]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 1:&#039;&#039;&#039; EOLine&lt;br /&gt;
&lt;br /&gt;
In this step the solver will orient all edges(For more information on edge orientation please click here.) and solve the DF and DB.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 2:&#039;&#039;&#039; Pseudo-F2L&lt;br /&gt;
&lt;br /&gt;
The solver will solve [[F2L]] using only R, U , and L moves. This is exactly the same as ZZ. Remember, that the DR edge is not permanent; so you can save moves by placing another OD (opposite of D) edge in the DR spot.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 3:&#039;&#039;&#039; Edge and orient Last Layer Corners ([[ELLC]], for short)&lt;br /&gt;
&lt;br /&gt;
This step inserts the missing cross piece(Solving DR)and orients the LL corners. There are only 27 algorithms for this step; they are listed below.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Step 4:&#039;&#039;&#039; [[PLL]]&lt;br /&gt;
&lt;br /&gt;
[[PLL]] is just [[PLL]].&lt;br /&gt;
&lt;br /&gt;
== See also ==&lt;br /&gt;
* [[Advanced F2L]]&lt;br /&gt;
&lt;br /&gt;
== External links ==&lt;br /&gt;
* [http://www.physics.rutgers.edu/~jtamanas/cubing/JTLE/JTLE.html JTLE algs]&lt;br /&gt;
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?t=14944 JTLE - does it have potential?]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category:3x3x3 other substeps]]&lt;br /&gt;
[[Category:Acronyms]]&lt;/div&gt;</summary>
		<author><name>Jtjogobonito</name></author>
	</entry>
	<entry>
		<id>https://www.speedsolving.com/wiki/index.php?title=JTLE&amp;diff=24362</id>
		<title>JTLE</title>
		<link rel="alternate" type="text/html" href="https://www.speedsolving.com/wiki/index.php?title=JTLE&amp;diff=24362"/>
		<updated>2014-08-11T03:05:18Z</updated>

		<summary type="html">&lt;p&gt;Jtjogobonito: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{Method Infobox&lt;br /&gt;
|name=JTLE&lt;br /&gt;
|image=JTLE.jpg&lt;br /&gt;
|proposers=John Tamanas&lt;br /&gt;
|year=2009&lt;br /&gt;
|anames=&lt;br /&gt;
|variants=&lt;br /&gt;
|steps=1&lt;br /&gt;
|algs=27&lt;br /&gt;
|moves=10.6 [[HTM]]&lt;br /&gt;
|purpose=&amp;lt;sup&amp;gt;&amp;lt;/sup&amp;gt;&lt;br /&gt;
* [[Speedsolving]]&lt;br /&gt;
}}&lt;br /&gt;
A system for orienting last layer corners while simultaneously placing the final DR edge. It is used in conjunction with methods which pre-orient LL edges (such as [[ZZ]] or [[Petrus]]).&lt;br /&gt;
&lt;br /&gt;
JTLE solve procedure:&lt;br /&gt;
# [[F2L]] is solved in the normal way, except for the DR edge.&lt;br /&gt;
# [[ELLC]] (Edge and orient Last Layer Corners)&lt;br /&gt;
# [[PLL]] (Permute Last Layer)&lt;br /&gt;
&lt;br /&gt;
== See also ==&lt;br /&gt;
* [[Advanced F2L]]&lt;br /&gt;
&lt;br /&gt;
== External links ==&lt;br /&gt;
* [http://www.physics.rutgers.edu/~jtamanas/cubing/JTLE/JTLE.html JTLE algs]&lt;br /&gt;
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?t=14944 JTLE - does it have potential?]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[[Category:3x3x3 other substeps]]&lt;br /&gt;
[[Category:Acronyms]]&lt;/div&gt;</summary>
		<author><name>Jtjogobonito</name></author>
	</entry>
</feed>