# Minimum number of cube rotations to solve f2l

#### tim

##### Member
Actually the question is "minimum number of cube rotations". So the answer is 0. "Maximum number of cube rotations" would be 1.

#### qqwref

##### Member
That's not what we mean when we say "minimum", tim... it's more technically some kind of min-max problem, since in this (and similar God's Algorithm type computations) we're concerned with the algorithm which produces the minimum possible value for the maximum number of required cube rotations (or turns or whatever) over all allowed scrambled positions.

##### Member
lol i wasn't aware that there were so many interpretations of my question!
Naturally, the cross is solved. I'm referring to F2L as the stage of Fridrich method, not the actual first two layers -- a common use of the terminology.
And naturally I am only concerned with y/y'/y2 rotations... I'm trying to apply this stuff to an actual solve... have you seen someone use x rotations to insert some F2L pairs?

The question where you are constrained to only <R,U> is interesting, but seems much harder to answer. And the answer probably does not yield any interesting insights, because people solve slots one by one, and dont really plan ahead to optimize number of rotations... for good reasons too! so never mind.

#### Gparker

##### Member
Im a little lost on this forum so my ansewer might be completely different from everyone elses, please dont make fun of(xD)

i use d turns for f2l instead of cube rotations, and i actualyy do sometimes insert f2l pairs with an x to it