https://www.speedsolving.com/wiki/api.php?action=feedcontributions&feedformat=atom&user=Chossenger 2026-10-31T00:51:43Z User contributions MediaWiki 1.43.8 https://www.speedsolving.com/wiki/index.php?title=2-Look_PLL&diff=33179 2017-10-13T03:00:43Z

<p>Chossenger: Fix links as well as text 🙄</p> <hr /> <div>This PLL system is used to permute the last layer after orientation. Of the 21 cases, only 6 are needed for '''2-Look PLL''' (commonly abbreviated as '''2LPLL'''). Permutation is broken into 2 steps: corner permutation (two cases), and edge permutation (four cases).<br /> <br /> * Step 1: '''Permutation of Corners'''. Requires 2 algorithms , to carry out:<br /> *# adjacent corner swap (any of [[PLL#T Permutation|T-perm]], [[PLL#A Permutation : a|A-perm]], [[PLL#F Permutation|F-perm]], [[PLL#G Permutation : a|G-perm]], [[PLL#J Permutation : a|J-perm]]...)<br /> *# diagonal corner swap (any of [[PLL#Y Permutation|Y-Perm]], [[PLL#V Permutation|V-Perm]], [[PLL#E Permutation|E-Perm]], [[PLL#N Permutation : a|N-Perm]])<br /> <br /> * Step 2: '''Permutation of Edges'''. Uses 4 algorithms (3 excluding mirrors):<br /> *# clockwise 3-edge cycle ([[PLL#U Permutation : b|U-perm b]])<br /> *# anticlockwise 3-edge cycle ([[PLL#U Permutation : a|U-perm a]])<br /> *# opposite edges swap ([[PLL#H Permutation|H-Perm]])<br /> *# adjacent edges swap ([[PLL#Z Permutation|Z-Perm]])<br /> <br /> == See also ==<br /> * [[PLL]]<br /> * [[2-Look OLL]]<br /> * [[4LLL]]<br /> * [[Last Layer]]<br /> <br /> == External links ==<br /> * [http://www.youtube.com/watch?v=S61q3FYVFis Badmephisto's 2-look PLL guide]<br /> <br /> <br /> [[Category:3x3x3 methods]]</div>

Chossenger https://www.speedsolving.com/wiki/index.php?title=2-Look_PLL&diff=33178 2017-10-13T02:59:10Z

<p>Chossenger: Correct 3-edge cycle links</p> <hr /> <div>This PLL system is used to permute the last layer after orientation. Of the 21 cases, only 6 are needed for '''2-Look PLL''' (commonly abbreviated as '''2LPLL'''). Permutation is broken into 2 steps: corner permutation (two cases), and edge permutation (four cases).<br /> <br /> * Step 1: '''Permutation of Corners'''. Requires 2 algorithms , to carry out:<br /> *# adjacent corner swap (any of [[PLL#T Permutation|T-perm]], [[PLL#A Permutation : a|A-perm]], [[PLL#F Permutation|F-perm]], [[PLL#G Permutation : a|G-perm]], [[PLL#J Permutation : a|J-perm]]...)<br /> *# diagonal corner swap (any of [[PLL#Y Permutation|Y-Perm]], [[PLL#V Permutation|V-Perm]], [[PLL#E Permutation|E-Perm]], [[PLL#N Permutation : a|N-Perm]])<br /> <br /> * Step 2: '''Permutation of Edges'''. Uses 4 algorithms (3 excluding mirrors):<br /> *# clockwise 3-edge cycle ([[PLL#U Permutation : a|U-perm b]])<br /> *# anticlockwise 3-edge cycle ([[PLL#U Permutation : b|U-perm a]])<br /> *# opposite edges swap ([[PLL#H Permutation|H-Perm]])<br /> *# adjacent edges swap ([[PLL#Z Permutation|Z-Perm]])<br /> <br /> == See also ==<br /> * [[PLL]]<br /> * [[2-Look OLL]]<br /> * [[4LLL]]<br /> * [[Last Layer]]<br /> <br /> == External links ==<br /> * [http://www.youtube.com/watch?v=S61q3FYVFis Badmephisto's 2-look PLL guide]<br /> <br /> <br /> [[Category:3x3x3 methods]]</div>

Chossenger