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

#### turtwig

##### Member
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:

##### Member
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

#### Attila

##### Member
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:

#### Chree

##### Member
This is from Chris Hardwick's sig... thought it was fun: R L F2 B2 L' R' U R L B2 F2 L' R' D (Added the last D to finish)

#### turtwig

##### Member
If M2 E2 M2 E2 counts then so should u D'.
Yeah, but none of the moves affect each other in any way... In M2 E2 M2 E2's case, they at least affect each other.

#### SenorJuan

##### Member
So (R U) 105 doesn't win, then....

#### DoctorKilgrave

##### Member
M M M M?

Sent from my XT1254 using Tapatalk