Cycleflip

From Speedsolving.com Wiki
Revision as of 02:48, 6 January 2013 by Noah.elkins (talk | contribs) (Created page with "frame|The Cycleflip == Cycleflip Algorithm == The '''Cycleflip Algorithm''', also called the '''Cycleflipping Algorithm''' is an alteration to the po...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
The Cycleflip


Cycleflip Algorithm

The Cycleflip Algorithm, also called the Cycleflipping Algorithm is an alteration to the popular Superflip Algorithm, [((M U')x4) y z')x4], which will flip three adjacent edges on both sides of the cube. This algorithm, like the Superflip, can be undone by doing the same algorithm twice. This algorithm is an uncommon but interesting pattern that is little-known but is being popularized.


The algorithm is: [((M' U')x4) y z')x4], which is altered from the Superflip by moving the middle slice up (M') instead of an upward (M) move. Expanded, the algorithm is: M' U' M' U' M' U' M' U' y z' M' U' M' U' M' U' M' U' y z' M' U' M' U' M' U' M' U' y z'


EXTERNAL LINKS:

PLL M' U' M' U' M' U' M' U' y z' M' U' M' U' M' U' M' U' y z' M' U' M' U' M' U' M' U' y z'