Cachan, officialy beating the scramble for Square1

[AvGalen]

(3,0) (-3,6) (0,1) (0,3) (3,0) (0,3) (0,5) (0,3) (0,3) (6,4) (6,5) (5,1) (0,3) (4,2) (6,4) (0,2) (-4,4) (0,0)

This was scramble 3 of group 2 in round 1. Good luck finding a solution that is (way) shorter than the scramble

 

[MTGjumper]

OK, so I found an 8 slice solution. What times did people get?

Edit: 1,2 / -3,-3 / -2,3 / 3 / 2 / -3 / 3,3 / 0,-3 / -3,-3

 

[ben1996123]

(1,2)(-3,3)(-5,0)(-3,0) = 4 moves to an A perm..

 

[CRO]

Lolscramble.

 

[Lid]

lets give it a try ... -2,-1/3,3/1,6/0,3/2,0/3,0/-3,-3/0,3/3,3

sq1optim gives this as one optimal solution

1,2/-3,0/0,3/0,-3/-2,0/3,0/-1,0/0,-3/0,6 [8|18]

 

[AvGalen]

I did a 12.56, Zoé did a 14.13 and Clément go 13.13+2
I think I went from 28 single and 50 average to "top 20" of the world
and the best thing is that the whole solve was intuitive of course

 

[qqwref]

Nobody beat the WR single?

 

[kinch2002]

The problem is that it's kind of hard to see silly sq-1 scrambles before people start to get fast times on them. Maybe a solution needs to be found, because it seems like stupid scrambles are way too common on sq-1 (I have things like 5.xx and 6.xx singles at home, when I average >20).

EDIT: Congrats on top 20 in the world AVG

 

[TMOY]

Nobody beat the WR single?

Unfortunately all the fastest competitors were in the other group

 

[AvGalen]

We gave the same scramble to Erik and Joey but they couldn't solve it "fast".
and my turning speed and square-1-quality is just way too low to get close to WR. Even after trying my solution several times I can't break the WR .... but I am sure all other 19 people in the top 20 could

 

[TMOY]

I tried it too and got 13.xx. In my case, I think being left-handed didn't help (after separation, I got an A-perm on bottom instead of an A-perm on top).

 

[Meep]

I got 6.11 ): EO skip then double-J

 

[y235]

12.77
this was the second try but in the first one i started wrong

 

[Kirjava]

Maybe a solution needs to be found, because it seems like stupid scrambles are way too common on sq-1

Say no to scramble filtering.

 

[Tim Reynolds]

Say yes to random-state scrambling.

 

[qqwref]

Let's put exactly one easy scramble in every avg5 - that will make it fair

 

[AvGalen]

I got 6.11 ): EO skip then double-J

Same, but I needed twice that amount of time

 

[Stefan]

sq1optim gives this as one optimal solution
1,2/-3,0/0,3/0,-3/-2,0/3,0/-1,0/0,-3/0,6 [8|18]

Can you please find optimal solutions for all prefixes of the scramble with 8+ moves?
Optimal solution for (3,0) (-3,6) (0,1) (0,3) (3,0) (0,3) (0,5) (0,3) (0,3)
Optimal solution for (3,0) (-3,6) (0,1) (0,3) (3,0) (0,3) (0,5) (0,3) (0,3) (6,4)
Optimal solution for (3,0) (-3,6) (0,1) (0,3) (3,0) (0,3) (0,5) (0,3) (0,3) (6,4) (6,5)
Optimal solution for (3,0) (-3,6) (0,1) (0,3) (3,0) (0,3) (0,5) (0,3) (0,3) (6,4) (6,5) (5,1)
Optimal solution for (3,0) (-3,6) (0,1) (0,3) (3,0) (0,3) (0,5) (0,3) (0,3) (6,4) (6,5) (5,1) (0,3)
Optimal solution for (3,0) (-3,6) (0,1) (0,3) (3,0) (0,3) (0,5) (0,3) (0,3) (6,4) (6,5) (5,1) (0,3) (4,2)
Optimal solution for (3,0) (-3,6) (0,1) (0,3) (3,0) (0,3) (0,5) (0,3) (0,3) (6,4) (6,5) (5,1) (0,3) (4,2) (6,4)
Optimal solution for (3,0) (-3,6) (0,1) (0,3) (3,0) (0,3) (0,5) (0,3) (0,3) (6,4) (6,5) (5,1) (0,3) (4,2) (6,4) (0,2)
Optimal solution for (3,0) (-3,6) (0,1) (0,3) (3,0) (0,3) (0,5) (0,3) (0,3) (6,4) (6,5) (5,1) (0,3) (4,2) (6,4) (0,2) (-4,4)
I'd like to see whether it stays around 8 moves or gets farther away and then comes closer.

Maybe a solution needs to be found, because it seems like stupid scrambles are way too common on sq-1

Define "stupid scramble".

 

[cuBerBruce]

Can you please find optimal solutions for all prefixes of the scramble with 8+ moves?
Optimal solution for (3,0) (-3,6) (0,1) (0,3) (3,0) (0,3) (0,5) (0,3) (0,3)
Optimal solution for (3,0) (-3,6) (0,1) (0,3) (3,0) (0,3) (0,5) (0,3) (0,3) (6,4)
Optimal solution for (3,0) (-3,6) (0,1) (0,3) (3,0) (0,3) (0,5) (0,3) (0,3) (6,4) (6,5)
Optimal solution for (3,0) (-3,6) (0,1) (0,3) (3,0) (0,3) (0,5) (0,3) (0,3) (6,4) (6,5) (5,1)
Optimal solution for (3,0) (-3,6) (0,1) (0,3) (3,0) (0,3) (0,5) (0,3) (0,3) (6,4) (6,5) (5,1) (0,3)
Optimal solution for (3,0) (-3,6) (0,1) (0,3) (3,0) (0,3) (0,5) (0,3) (0,3) (6,4) (6,5) (5,1) (0,3) (4,2)
Optimal solution for (3,0) (-3,6) (0,1) (0,3) (3,0) (0,3) (0,5) (0,3) (0,3) (6,4) (6,5) (5,1) (0,3) (4,2) (6,4)
Optimal solution for (3,0) (-3,6) (0,1) (0,3) (3,0) (0,3) (0,5) (0,3) (0,3) (6,4) (6,5) (5,1) (0,3) (4,2) (6,4) (0,2)
Optimal solution for (3,0) (-3,6) (0,1) (0,3) (3,0) (0,3) (0,5) (0,3) (0,3) (6,4) (6,5) (5,1) (0,3) (4,2) (6,4) (0,2) (-4,4)
I'd like to see whether it stays around 8 moves or gets farther away and then comes closer.

Starting with (3,0) (-3,6) (0,1) (0,3) (3,0) (0,3) (0,5) (0,3), I get:

6,7,8,9,8,7,8,9,8,9

Details:

Spoiler

Optimal solution for (3,0) (-3,6) (0,1) (0,3) (3,0) (0,3) (0,5) (0,3):
3,0/0,3/0,10/3,6/2,0/0,3/6,6 [6|15]

Optimal solution for (3,0) (-3,6) (0,1) (0,3) (3,0) (0,3) (0,5) (0,3) (0,3):
3,9/0,9/3,9/1,9/0,9/2,0/3,0/ [7|17]

Optimal solution for (3,0) (-3,6) (0,1) (0,3) (3,0) (0,3) (0,5) (0,3) (0,3) (6,4):
/3,11/3,6/3,9/1,9/3,6/0,2/6,9/6,6 [8|23]

Optimal solution for (3,0) (-3,6) (0,1) (0,3) (3,0) (0,3) (0,5) (0,3) (0,3) (6,4) (6,5):
5,7/1,0/3,5/3,3/0,8/1,7/0,9/0,3/11,8/6,4 [9|25]

Optimal solution for (3,0) (-3,6) (0,1) (0,3) (3,0) (0,3) (0,5) (0,3) (0,3) (6,4) (6,5) (5,1):
0,3/0,8/1,6/3,3/2,0/4,4/0,3/9,0/5,3 [8|21]

Optimal solution for (3,0) (-3,6) (0,1) (0,3) (3,0) (0,3) (0,5) (0,3) (0,3) (6,4) (6,5) (5,1) (0,3):
0,8/1,6/3,3/2,0/4,4/0,3/9,0/5,3 [7|19]

Optimal solution for (3,0) (-3,6) (0,1) (0,3) (3,0) (0,3) (0,5) (0,3) (0,3) (6,4) (6,5) (5,1) (0,3) (4,2):
/2,0/3,10/3,3/3,1/2,2/1,10/6,3/11,9 [8|23]

Optimal solution for (3,0) (-3,6) (0,1) (0,3) (3,0) (0,3) (0,5) (0,3) (0,3) (6,4) (6,5) (5,1) (0,3) (4,2) (6,4):
2,4/1,10/3,3/0,10/3,9/5,8/1,4/5,11/10,1/5,6 [9|28]

Optimal solution for (3,0) (-3,6) (0,1) (0,3) (3,0) (0,3) (0,5) (0,3) (0,3) (6,4) (6,5) (5,1) (0,3) (4,2) (6,4) (0,2):
3,6/0,9/3,0/3,6/0,7/3,6/2,9/0,3/3,6 [8|22]

Optimal solution for (3,0) (-3,6) (0,1) (0,3) (3,0) (0,3) (0,5) (0,3) (0,3) (6,4) (6,5) (5,1) (0,3) (4,2) (6,4) (0,2) (-4,4)
2,10/2,10/4,2/2,10/2,10/2,1/3,3/0,5/9,0/3,1 [9|27]

Edit: I note that I used the -w option so that it guaranteed the minimal number of twists, rather than the optimal solution in turn metric.

 

[Lucas Garron]

Say yes to random-state scrambling.

This. Fortunately, the problem of random Square-1 scrambles has been solved. Unfortunately, there is still no official scrambler for it.