BlueDevil
Veteran
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...
If I saw that scramble, I would scratch it and generate a new one...
Follow along with the video below to see how to install our site as a web app on your home screen.
Note: This feature may not be available in some browsers.
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...
Also, delegates are specifically NOT supposed to throw out easy scrambles.
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.
Yes it was inverse actually. 2x2 can deceive you like thatIt was a 4 move scramble, and a 4 move solution that wasn't an inverse.
This is where we need an optimal state scrambler. I think Prisma Puzzle Timer has one for the 2x2 cube, so that could be used in the future.
I'm pretty sure the WCA scrambler is also optimum for 2x2.
Every 2x2 scramble needs 11 moves maximum to solve. If there was a 4 move scramble, it can't be optimum.
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.
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.
we need a scramble generator that generates scrambles that need 11 moves minimum to solve
The world record was only beaten once, because the 0.69 was the first solve
but the time ( 0.96 ) was beaten 3 times
but the time ( 0.96 ) was beaten 3 times