Difference between revisions of "Lin"

From Speedsolving.com Wiki
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=[[Tse-Kan Lin]]
|year=2016/2017
+
|year=2010
|anames=
+
|anames=TKL
 
|variants=
 
|variants=
 
|steps=5
 
|steps=5
 +
|algs=3-14
 
|moves=
 
|moves=
 
|purpose=<sup></sup>
 
|purpose=<sup></sup>
 
* [[Speedsolving]]
 
* [[Speedsolving]]
 
}}
 
}}
The '''Lin method''' is a speedsolving/novelty method for the [[Square-1]] puzzle. It is very similar to RouxFOP in terms of steps.
+
The '''Lin method''' is a speedsolving/novelty method for the [[Square-1]] 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   A two step approach is possible, first inserting the edge and then permuting the corners, is possible. This approach requires around 2 algs, which are basic [[Vandenbergh]] algs.
+
:* 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. Insert the DF and DB edges.
+
* 4. [http://ranzha.cubing.net/square-1/pll.html EPLL] (excluding corners)
* 5. [[EPLL|Permute edges of last layer]]
 
  
 
== CP + DF algs ==
 
== CP + DF algs ==
(Swaps opposite corners)
+
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 / -4,-3 / -3,0 / -3,-3 / -3,0 / -2,-3 /  
+
Adjacent swap R: (1,0) / (2,-1) / (0,-3) / (3,0) / (-3,0) / (-2,4) /
  
(Swaps left corners)
+
Adjacent swap F: (0,-1) / (4,-2) / (-3,0) / (0,3) / (0,-3) / (-1,2) /
  
1,0 / 3,0 / 3,-3 / -1,2 / 1,-2 / 3,0 /  
+
Adjacent swap B: (4,-3) / (-3,0) / (-1,2) / (1,-2) / (-3,3) / (-3,0) /
 
 
(Swaps right corners)
 
 
 
1,0 / 2,-1 / 0,-3 / 3,0 / -3,0 / -2,4 /
 
 
 
(Swaps front corners)
 
 
 
0,-1 / 4,-2 / -3,0 / 0,3 / 0,-3 / -1,2 /
 
 
 
(Swaps back corners)
 
 
 
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]
:* '''Note:''' ''No other resources of the method have yet been found, so it is suggested that Jbacboy is the creator.''
 

Latest revision as of 04:17, 24 February 2018

Lin method
Information about the method
Proposer(s): Tse-Kan Lin
Proposed: 2010
Alt Names: TKL
Variants:
No. Steps: 5
No. Algs: 3-14
Avg Moves:
Purpose(s):

The Lin method is a speedsolving/novelty method for the Square-1 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) /

See also

External links