badmephisto
Member
I was recently trying to find the absolute upper bound on the number of cube rotations needed to solve f2l. For a given cube rotation you are constrained to use only <R,U,L> (and D if you want to... I dont think it changed anything) The problem seems to be pretty hard, and my current guess is 2, for extremely long reasons.
Has anyone ever looked at this problem? Can anyone guess the answer?
EDIT: Changed <F, U, L> to <R, U, L>, of course, I'm sorry!
Has anyone ever looked at this problem? Can anyone guess the answer?
EDIT: Changed <F, U, L> to <R, U, L>, of course, I'm sorry!
Last edited: