How else would you measure difficulty? You can't be method biased, so optimal length is the only way.
It's around 3000 miles from NY to London. It's also around 3000 miles from NY to San Francisco. Are they both equally feasible to walk to? No. there's a @#%@#$% ocean in the way.
You can't compare solves based on optimal solve length because nobody solves cubes optimally. Stop acting dumb. You have to take into account all the viable methods (which I have in my program).
Therefore, it is random state, is it not?
No. The mis-scramble was
A random state, but it was not
Random State. Look up
what random state is. It's when you pick a random (possible) cube state and generate a scramble to get there. Making a mistake in a "random state scramble" changes it to a "random move scramble," which is ILLEGAL under the regulations.
Again, think before you type.
4 moves to 3 moves is "significantly easier"?
a) it's 3 moves 2-gen vs 4 moves 3-gen. This is an OH solve. 2-gen is incredibly easier than 3-gen. Also it's 1-move less.
b) it doesn't even matter HOW MUCH EASIER the mis-scramble was. Even if it's only .00000001% easier, it's an unfair advantage, which directly contradicts the
WCA's Mission Statement. No other competitors got this scramble.
You just contradicted yourself. If it doesn't provide a CFOP advantage, then what are you arguing for? Also, we must stay method neutral.
Again, read the thread. My program checked starts for Petrus/CFOP/and Roux to be as method-neutral as possible. There were no possible 1-move disparity mis-scrambles that gave a larger advantage (in any considered solution approach) than the mis-scramble that Feliks was provided. In easy words (because you seem to need them), "Feliks got the easiest 1-move mis-scramble."
I'm done arguing until someone comes out with a coherent argument in favor of keeping this solve. The last 5 pages of this thread are just me explaining obvious things to those too lazy to read the thread.