When solving a Rubik's Cube, a common algorithm in speedcubing is the "sexy move," in which the solver performs the moveset meaning, "rotate the rightmost face clockwise, then the uppermost face clockwise, then the rightmost face counterclockwise, then the uppermost face counterclockwise."
How many times will a solver have to perform the "sexy move," starting in a solved state, before he returns to the solved state again?
Learn more about Rubik's move notation here .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
do it practically