I don't think this was ever discussed, but have you ever thought of what the smallest non-reducable maneuver that gives an Identity is!
My defn of non-reducable maneuver is that there are no X X' / X X2 combinations in the maneuver recursively.
I recently came across this:
F R U2 B U B'...
This is something very frequently used in FMC.
Apply scramble on solved cube, solve till a point. Invert the whole thing and work from there. Something like this.
If the problem statement is S,
On identity(solved cube) execute S M1 (till one can't figure a good path from there on)
I saw this member introductions a little late. I have already made few posts in the forum but lemme introduce myself in here.
My previous cubing:
I solved the cube for the first time around 10 years back. That is when I was 11 year old, when my mom bought me a rubik's cube. When I solved it...