The 2x2x2 "Example Solve" Game!

next: R' F' R2 U' R' U2 R' U' F U2 F
 Twizzle link 
 Setup 
R' F' R2 U' R' U2 R' U' F U2 F
 Moves 
z2
R2 U2 R U R' // W layer
U R U R' U' R' F R F' // CLL


Next: F' R2 F' R U2 R' F2 R U2
 
 Twizzle link 
 Setup 
U' F R' U' R U' R2 U F'
 Moves 
x' y
R U R' // white side
U2 F (R U R' U')2 F' // OLL
F R U' R' U' R U R' F' R U R' U' R' F R F' // PLL


next: R' F U' R U' R U2 F2 U' R U
inspection: y'
w layer: F U2 L' U' L
pll: U' j perm
ikik my solutions suck 💀
next: R' U' R U R U F' U F
 
…no, where do you think we get 4-movers from??? a 2x2 scrambler is (most likely) random state with a minimum move count of 4, so that’s why this exists.
What happened to CR/WR solves?

None of your questions has anything to do with my question.

I was confused because I thought that a scrambler like csTimer or TNoodle provides an optimal solution for a particular (random state) - hence finding a shorter (than optimal) solution would be impossible. Hence the confusion and my question.
Apperently, my question got answered from elsewhere:

The standard scramble generators already have scramble obfuscation/padding by default for 2/skewb/pyra. E.g. for 2³, csTimer forces the scramble sequence to be at least 9 moves, while TNoodle forces 11 moves.

So, it turned out, they do NOT provide optimal scrambling sequences.
 
Back
Top