Difference between revisions of "Lin"

(added CP+DF algs)
Line 20: Line 20:
 
* 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 is possible, 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. [[EPLL|Permute edges of last layer]]
* 5. [[EPLL|Permute edges of last layer]]
 
  
 
== CP + DF algs ==
 
== CP + DF algs ==
(Swaps opposite corners)
+
{{Alg|1,0 / -4,-3 / -3,0 / -3,-3 / -3,0 / -2,-3 / | stage=OppositeCorners}}
 
+
{{Alg|1,0 / 3,0 / 3,-3 / -1,2 / 1,-2 / 3,0 / | stage=LeftCorners}}
1,0 / -4,-3 / -3,0 / -3,-3 / -3,0 / -2,-3 /  
+
{{Alg|1,0 / 2,-1 / 0,-3 / 3,0 / -3,0 / -2,4 / | stage=RightCorners}}
 
+
{{Alg|0,-1 / 4,-2 / -3,0 / 0,3 / 0,-3 / -1,2 / | stage=FrontCorners}}
(Swaps left corners)
+
{{Alg|4,-3 / -3,0 / -1,2 / 1,-2 / -3,3 / -3,0 / | stage=BackCorners}}
 
 
1,0 / 3,0 / 3,-3 / -1,2 / 1,-2 / 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 ==

Revision as of 19:18, 13 March 2017

Lin method
Information about the method
Proposer(s): ??
Proposed: 2016/2017
Alt Names:
Variants:
No. Steps: 5
No. Algs: unknown
Avg Moves:
Purpose(s):

The Lin method is a speedsolving/novelty method for the Square-1 puzzle. It is very similar to RouxFOP in terms of steps.

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 is possible, first inserting the edge and then permuting the corners, is possible. This approach requires around 2 algs, which are basic Vandenbergh algs.

CP + DF algs

Speedsolving Logo tiny.gif OppositeCorners 1,0 / -4,-3 / -3,0 / -3,-3 / -3,0 / -2,-3 /
Speedsolving Logo tiny.gif LeftCorners 1,0 / 3,0 / 3,-3 / -1,2 / 1,-2 / 3,0 /
Speedsolving Logo tiny.gif RightCorners 1,0 / 2,-1 / 0,-3 / 3,0 / -3,0 / -2,4 /
Speedsolving Logo tiny.gif FrontCorners 0,-1 / 4,-2 / -3,0 / 0,3 / 0,-3 / -1,2 /
Speedsolving Logo tiny.gif BackCorners 4,-3 / -3,0 / -1,2 / 1,-2 / -3,3 / -3,0 /


See also

External links

  • Note: No other resources of the method have yet been found, so it is suggested that Jbacboy is the creator.