https://www.speedsolving.com/wiki/api.php?action=feedcontributions&feedformat=atom&user=Chaoscubes03 Speedsolving.com Wiki - User contributions [en] 2026-10-30T17:35:52Z User contributions MediaWiki 1.43.8 https://www.speedsolving.com/wiki/index.php?title=Lin&diff=36005 Lin 2018-02-24T04:17:55Z <p>Chaoscubes03: Reformatted algorithms and took off links because they aren&#039;t 3x3x3 algorithms</p> <hr /> <div>{{Method Infobox<br /> |name=Lin<br /> |image=<br /> |proposers=[[Tse-Kan Lin]]<br /> |year=2010<br /> |anames=TKL<br /> |variants=<br /> |steps=5<br /> |algs=3-14<br /> |moves=<br /> |purpose=&lt;sup&gt;&lt;/sup&gt;<br /> * [[Speedsolving]]<br /> }}<br /> The '''Lin method''' is a speedsolving/novelty method for the [[Square-1]] puzzle.<br /> <br /> == The steps ==<br /> * 1. Turn the puzzle into a cubic shape.<br /> * 2. Build the first two blocks.<br /> :* 2a. Build a 1x1x3 block on the bottom layer of the puzzle, either the left or the right side.<br /> :* 2b. Build a second block in the bottom layer, opposite the first one.<br /> * 3. CP + DF (Corner permutation + DF edge)<br /> :* 3a. Insert one of the two remaining D edges.<br /> :* 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.<br /> * 4. [http://ranzha.cubing.net/square-1/pll.html EPLL] (excluding corners)<br /> <br /> == CP + DF algs ==<br /> Diagonal swap: (1,0) / (-4,-3) / (-3,0) / (-3,-3) / (-3,0) / (-2,-3) /<br /> <br /> Adjacent swap L: (1,0) / (3,0) / (3,-3) / (-1,2) / (1,-2) / (3,0) /<br /> <br /> Adjacent swap R: (1,0) / (2,-1) / (0,-3) / (3,0) / (-3,0) / (-2,4) /<br /> <br /> Adjacent swap F: (0,-1) / (4,-2) / (-3,0) / (0,3) / (0,-3) / (-1,2) /<br /> <br /> Adjacent swap B: (4,-3) / (-3,0) / (-1,2) / (1,-2) / (-3,3) / (-3,0) /<br /> <br /> == See also ==<br /> * [[List of methods]]<br /> * [[Roux n Skrew]]<br /> * [[Vandenbergh]]<br /> <br /> == External links ==<br /> * [https://www.youtube.com/watch?v=OLrFbXhIyj8 ''Jbacboy'''s tutorial on the method]</div> Chaoscubes03 https://www.speedsolving.com/wiki/index.php?title=Lin&diff=36004 Lin 2018-02-24T04:08:39Z <p>Chaoscubes03: Fixed Adjacent Swap F alg</p> <hr /> <div>{{Method Infobox<br /> |name=Lin<br /> |image=<br /> |proposers=[[Tse-Kan Lin]]<br /> |year=2010<br /> |anames=TKL<br /> |variants=<br /> |steps=5<br /> |algs=3-14<br /> |moves=<br /> |purpose=&lt;sup&gt;&lt;/sup&gt;<br /> * [[Speedsolving]]<br /> }}<br /> The '''Lin method''' is a speedsolving/novelty method for the [[Square-1]] puzzle.<br /> <br /> == The steps ==<br /> * 1. Turn the puzzle into a cubic shape.<br /> * 2. Build the first two blocks.<br /> :* 2a. Build a 1x1x3 block on the bottom layer of the puzzle, either the left or the right side.<br /> :* 2b. Build a second block in the bottom layer, opposite the first one.<br /> * 3. CP + DF (Corner permutation + DF edge)<br /> :* 3a. Insert one of the two remaining D edges.<br /> :* 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.<br /> * 4. [http://ranzha.cubing.net/square-1/pll.html EPLL] (excluding corners)<br /> <br /> == CP + DF algs ==<br /> {{Alg|1,0 / -4,-3 / -3,0 / -3,-3 / -3,0 / -2,-3 / | stage=Diagonal Swap}}<br /> {{Alg|1,0 / 3,0 / 3,-3 / -1,2 / 1,-2 / 3,0 / | stage=Adjacent swap L}}<br /> {{Alg|1,0 / 2,-1 / 0,-3 / 3,0 / -3,0 / -2,4 / | stage=Adjacent swap R}}<br /> {{Alg|0,-1 / 4,-2 / -3,0 / 0,3 / 0,-3 / -1,2 / | stage=Adjacent swap F}}<br /> {{Alg|4,-3 / -3,0 / -1,2 / 1,-2 / -3,3 / -3,0 / | stage=Adjacent swap B}}<br /> <br /> == See also ==<br /> * [[List of methods]]<br /> * [[Roux n Skrew]]<br /> * [[Vandenbergh]]<br /> <br /> == External links ==<br /> * [https://www.youtube.com/watch?v=OLrFbXhIyj8 ''Jbacboy'''s tutorial on the method]</div> Chaoscubes03