Lin
| ||||||||||||||||||||||
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)
PLL + 1
Alternatively steps 3b. and 4. can be combined into 1 step which solves the DF piece and everything else. This step is called PLL + 1 and has 72 algorithms excluding the 21 PLL algorithms. It is much faster than CP + DF / EPLL but has many more algorithms so there is a tradeoff. It is important to note that PLL + 1 only works if you use CSP because parity is not accounted for in any of the algorithms. PLL + 1 is implemented by most top Lin solvers.
CP + DF algs
Solved Corners: (1,0) / (0,3) / (3,0) / (-1,-1) / (-2,1) / (0,-3) / (-1,0)
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) /
