• Welcome to the Speedsolving.com, home of the web's largest puzzle community!
    You are currently viewing our forum as a guest which gives you limited access to join discussions and access our other features.

    Registration is fast, simple and absolutely free so please, join our community of 35,000+ people from around the world today!

    If you are already a member, simply login to hide this message and begin participating in the community!

Fewest Number of moves that doesn't Affect the Cube?

Joined
Apr 2, 2015
Messages
535
Likes
287
Thread starter #1
So I was thinking about the fewest number of moves that one could apply on a cube to keep to return to the same position. So, for example, if you applied it to a solved cube, it would become solved again.
The algorithm can't just invert what it does, (ex. R R').
 
Last edited:
Joined
Apr 5, 2016
Messages
32
Likes
3
#6
M2 and E2 are commutators, as they share parts of the cube while turning. R and L don't have a intersection, so they can't be counted, But M2 and E2 follow the X,Y X',Y' rule that makes it a commutator, which actually affects the cube
 
Joined
Nov 7, 2010
Messages
289
Likes
44
Location
Halásztelek, Hungary
WCA
2012HORV01
#7
R F2 U D' L2 F2 R2 D U' B2 R
R2 D2 B2 U' D' B2 U2 R2 U' D'
R2 U' L2 U2 D2 R2 U L2 U2 D2

R2 B2 R2 L2 B2 F2 L2 R2 F2 R2

Most often possible to find like this, of domino solutions (almost infinite number of possibilities)
 
Last edited:
Top