https://www.speedsolving.com/wiki/api.php?action=feedcontributions&feedformat=atom&user=KitKat 2026-11-02T20:07:05Z User contributions MediaWiki 1.43.8 https://www.speedsolving.com/wiki/index.php?title=User:KitKat&diff=40899 2019-11-20T00:45:13Z

<p>KitKat: Blanked the page</p> <hr /> <div></div>

KitKat https://www.speedsolving.com/wiki/index.php?title=User:KitKat&diff=40898 2019-11-20T00:44:01Z

<p>KitKat: Created page with &quot;{{Method Infobox |name=FATE |proposers=Catherine Trace |year=2019 |anames |steps=4 |algs=7 |purpose= Speedsolving,Big Cubes }} FATE (First layer, Adjacent layer,...&quot;</p> <hr /> <div>{{Method Infobox<br /> |name=FATE<br /> |proposers=[[Catherine Trace]]<br /> |year=2019<br /> |anames<br /> |steps=4<br /> |algs=7<br /> |purpose= [[Speedsolving]],[[Big Cubes]]<br /> }}<br /> <br /> FATE (First layer, Adjacent layer, Third Layer, Edges) is a method idea mentioned by [[SuperAntonioVivaldi]] in a video.In 2019,[[Catherine Trace]] has developed a method that can be used for all NxN puzzles. It can also be seen as a substep of the [[Fail Method]], except that it actually solves the cube.<br /> <br /> It takes the approach of solving by Layer-by-Layer, however it solves an adjacent layer instead of the middle layer.<br /> <br /> == The Steps ==<br /> <br /> 1. Make a layer + 2 adjacent F2L edges. This is intuitive.<br /> <br /> 2. Solve the second layer edge and corners. This is less intuitive than the first step but can be done using commutators<br /> <br /> 3. Solve the corners. This can be done and uses 5 algorithms to solve and position them<br /> <br /> 4. Last 5 edges. You can use commutators to solve the rest<br /> <br /> <br /> <br /> <br /> <br /> <br /> [[Category:3x3x3 methods]]<br /> [[Category:3x3x3 speedsolving methods]]</div>

KitKat