<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://www.speedsolving.com/wiki/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Seeegma</id>
	<title>Speedsolving.com Wiki - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://www.speedsolving.com/wiki/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Seeegma"/>
	<link rel="alternate" type="text/html" href="https://www.speedsolving.com/wiki/index.php/Special:Contributions/Seeegma"/>
	<updated>2026-11-05T04:37:10Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.43.11</generator>
	<entry>
		<id>https://www.speedsolving.com/wiki/index.php?title=Superflip&amp;diff=21431</id>
		<title>Superflip</title>
		<link rel="alternate" type="text/html" href="https://www.speedsolving.com/wiki/index.php?title=Superflip&amp;diff=21431"/>
		<updated>2012-06-30T17:45:17Z</updated>

		<summary type="html">&lt;p&gt;Seeegma: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;[[Image:Superflip.png|frame|The superflip.]]&lt;br /&gt;
&lt;br /&gt;
The &#039;&#039;&#039;superflip&#039;&#039;&#039; is a famous position of the [[3x3x3]] where all corners are solved, and all edges are in the correct location but flipped. Despite its symmetry, this is an extremely difficult pattern, which is known to require 20 moves [[HTM]] to solve (in fact it was the first position that was proven to require that many moves). No position exists that requires more than 20 moves.&lt;br /&gt;
&lt;br /&gt;
The superflip also has a few interesting properties because of the way it interacts with the [[Rubik&#039;s Cube Group]]. If you do a [[commutator]] with the superflip and any other algorithm, you will always end up back at the solved state; the superflip is also self-inverse, which means doing it twice will bring you back to the solved state. Also, because the superflip is completely symmetrical but not solved, any move will bring it to a position that is easier to solve.&lt;br /&gt;
&lt;br /&gt;
One optimal solution in HTM for the superflip is U R2 F B R B2 R U2 L B2 R U&#039; D&#039; R2 F R&#039; L B2 U2 F2. The superflip also requires a minimum of 24 quarter turns to solve, and a minimum of 16 slice turns. One example of an optimal solution which requires 16 slice turns is S U B2 D2 M D&#039; M2 S U R2 D M2 U B2 U S2. Another solution which requires 24 turns [[STM]] is MU&#039;MU&#039;MU&#039;MU&#039;yz&#039;MU&#039;MU&#039;MU&#039;MU&#039;yz&#039;MU&#039;MU&#039;MU&#039;MU&#039;. This is particularly easy to remember, as it is simply (MU&#039;)x4 followed by a yz&#039;. This is repeated three times.&lt;br /&gt;
&lt;br /&gt;
== See also ==&lt;br /&gt;
* [[Super Twist]]&lt;br /&gt;
* [[God&#039;s Algorithm]]&lt;br /&gt;
* [[Puzzle theory]]&lt;br /&gt;
&lt;br /&gt;
[[Category:Puzzle theory]]&lt;br /&gt;
[[Category:Algorithms]]&lt;/div&gt;</summary>
		<author><name>Seeegma</name></author>
	</entry>
</feed>