Difference between revisions of "Lin"
From Speedsolving.com Wiki
Generalpask (talk  contribs) 
Chaoscubes03 (talk  contribs) m (Reformatted algorithms and took off links because they aren't 3x3x3 algorithms) 

(9 intermediate revisions by 5 users not shown)  
Line 2:  Line 2:  
name=Lin  name=Lin  
image=  image=  
−  proposers=  +  proposers=[[TseKan Lin]] 
−  year=  +  year=2010 
−  anames=  +  anames=TKL 
variants=  variants=  
steps=5  steps=5  
+  algs=314  
moves=  moves=  
purpose=<sup></sup>  purpose=<sup></sup>  
* [[Speedsolving]]  * [[Speedsolving]]  
}}  }}  
−  The '''Lin method''' is a speedsolving/novelty method for the [[Square1]] puzzle  +  The '''Lin method''' is a speedsolving/novelty method for the [[Square1]] puzzle. 
== The steps ==  == The steps ==  
Line 20:  Line 21:  
* 3. CP + DF (Corner permutation + DF edge)  * 3. CP + DF (Corner permutation + DF edge)  
:* 3a. Insert one of the two remaining D edges.  :* 3a. Insert one of the two remaining D edges.  
−  :* 3b. Insert the last one in DF while simultaneously permuting the top layer corners. This step requires  +  :* 3b. Insert the last one in DF (from UL) while simultaneously permuting the top layer corners. This step requires 6 algs, specified below. A two step approach, first inserting the edge and then permuting the corners, is possible. This approach requires around 2 algs, which are basic [[Vandenbergh]] algs. 
−  * 4.  +  * 4. [http://ranzha.cubing.net/square1/pll.html EPLL] (excluding corners) 
−  
== CP + DF algs ==  == CP + DF algs ==  
−  (  +  Diagonal swap: (1,0) / (4,3) / (3,0) / (3,3) / (3,0) / (2,3) / 
+  
+  Adjacent swap L: (1,0) / (3,0) / (3,3) / (1,2) / (1,2) / (3,0) /  
−  1,0 /   +  Adjacent swap R: (1,0) / (2,1) / (0,3) / (3,0) / (3,0) / (2,4) / 
−  (  +  Adjacent swap F: (0,1) / (4,2) / (3,0) / (0,3) / (0,3) / (1,2) / 
−  +  Adjacent swap B: (4,3) / (3,0) / (1,2) / (1,2) / (3,3) / (3,0) /  
−  
−  (  
−  
−  
−  
−  (  
−  
−  
−  
−  (  
−  
−  
== See also ==  == See also ==  
Line 52:  Line 42:  
== External links ==  == External links ==  
* [https://www.youtube.com/watch?v=OLrFbXhIyj8 ''Jbacboy'''s tutorial on the method]  * [https://www.youtube.com/watch?v=OLrFbXhIyj8 ''Jbacboy'''s tutorial on the method]  
− 
Latest revision as of 04:17, 24 February 2018

The Lin method is a speedsolving/novelty method for the Square1 puzzle.
The steps
 1. Turn the puzzle into a cubic shape.
 2. Build the first two blocks.
 2a. Build a 1x1x3 block on the bottom layer of the puzzle, either the left or the right side.
 2b. Build a second block in the bottom layer, opposite the first one.
 3. CP + DF (Corner permutation + DF edge)
 3a. Insert one of the two remaining D edges.
 3b. Insert the last one in DF (from UL) while simultaneously permuting the top layer corners. This step requires 6 algs, specified below. A two step approach, first inserting the edge and then permuting the corners, is possible. This approach requires around 2 algs, which are basic Vandenbergh algs.
 4. EPLL (excluding corners)
CP + DF algs
Diagonal swap: (1,0) / (4,3) / (3,0) / (3,3) / (3,0) / (2,3) /
Adjacent swap L: (1,0) / (3,0) / (3,3) / (1,2) / (1,2) / (3,0) /
Adjacent swap R: (1,0) / (2,1) / (0,3) / (3,0) / (3,0) / (2,4) /
Adjacent swap F: (0,1) / (4,2) / (3,0) / (0,3) / (0,3) / (1,2) /
Adjacent swap B: (4,3) / (3,0) / (1,2) / (1,2) / (3,3) / (3,0) /