2x2 single WR at Trentin Open 2011

How did the WCA delegate let a 4 move scramble slide?

If I saw that scramble, I would scratch it and generate a new one...

I don't think it was a 4 move scramble, but a scramble with a 4 move solution. As it is a random state, albeit an easy one, it's perfectly legal so the WCA delegate shouldn't discard it. And besides, it would be difficult because the determine whether a scramble is too easy, the delegate has to go through all the scrambles, with the consequence that he can't compete because he has seen the scrambles before.
 
I don't think it was a 4 move scramble, but a scramble with a 4 move solution. As it is a random state, albeit an easy one, it's perfectly legal so the WCA delegate shouldn't discard it. And besides, it would be difficult because the determine whether a scramble is too easy, the delegate has to go through all the scrambles, with the consequence that he can't compete because he has seen the scrambles before.

There's a video with all 3 of the WR breaking solves.


It says at the end of the video the scramble and the solution.
It was a 4 move scramble, and a 4 move solution that wasn't an inverse.
 
Last edited by a moderator:
I got my first usable 2x2 3 days ago ive done 1 average of 100 @ 13.xx with best 6.39 i just did this scramble in 1.35 If qqtimer gave me this i would LOL and rescramble. WR's should be impressive this isnt to me. If i can do it that fast then with these current averages and bests its too easy.
 
Every 2x2 scramble needs 11 moves maximum to solve. If there was a 4 move scramble, it can't be optimum.

That's not how it works. There is a distribution of optimal lengths. There are some cases which require a minimum of 11 moves to solve, and there are some that only require 2 moves.

Here's a scramble: R U

Last time I checked, the optimal solution to that position wasn't 11 moves. The 2 move scramble was optimal.
 
That's not how it works. There is a distribution of optimal lengths. There are some cases which require a minimum of 11 moves to solve, and there are some that only require 2 moves.

Here's a scramble: R U

Last time I checked, the optimal solution to that position wasn't 11 moves. The 2 move scramble was optimal.

I must have got confused. What I meant was that here is where we need a scramble generator that generates scrambles that need 11 moves minimum to solve (optimal state). Then, the times would be more based on method and TPS.
 
I must have got confused. What I meant was that here is where we need a scramble generator that generates scrambles that need 11 moves minimum to solve (optimal state). Then, the times would be more based on method and TPS.

Do you even realize how few positions that is? It's a terrible idea. Speedcubing is not about solving random positions at the diameter of the cube group, it is about solving random positions.
 
we need a scramble generator that generates scrambles that need 11 moves minimum to solve

It should require the maximum number of quarter turns as well (14 quarter turns) to ensure it's really hard. Then everybody just needs to learn 108 algorithms to play God (probably fewer, thanks to symmetries).
 
Back
Top