![]() | Rubik's Cube: Scrambling with a computer generated 25 move scramble |
Place | Result | Name | Quote | Date |
---|---|---|---|---|
1 | 5.92 seconds | Piotr Kózka | I can do faster with nice scramble. | 20080925 |
2 | 5.95 seconds | Johannes Laire | This helps. | 20071031 |
3 | 6.05 seconds | Jason Baum | R' U R2 U R L' B2 U' R2 F' U F B U' D' L2 D' U R' B2 R D' B D L I wanted a sub 6 but this is good enough. | 20070510 |
4 | 6.30 seconds | Teo Kai Xiang | nice time could be better. i used this scramble: U L R' D B2 F' U2 L' R B' D L R B' U L2 R2 F' L2 B U2 L2 U B L' | 20090510 |
5 | 6.42 seconds | Patrick Jameson | it took me like 30 times to get this score. | 20070217 |
6 | 6.47 seconds | Harris Chan | Timed with a stackmat. It didn't feel all that fast I guess I can probably beat it. The scramble: U L' U2 F' R' F2 U' B' F' D2 L' B F D2 R D' U B F D L B2 F' D U2 | 20080318 |
7 | 6.78 seconds | Erik Akkersdijk | It is more fun to do 5 scrambles in a row. | 20070405 |
8 | 6.82 seconds | Stefan Huber | Best try out of my average of 12 which was 8.90. The scramble was U R F U R' B R F U' F2 R B' R' U D2 F2 R2 U' D2 B' R' U F' R U'. | 20080127 |
9 | 6.89 seconds | Danilo Caimano | this is the scramble!: D R' F' R2 U' D B R F2 R' U R2 U2 D' B2 F2 D2 R' U L R B2 L2 R2 F' | 20090201 |
10 | 6.90 seconds | Fubo Wang | B U B2 L2 R' F U' L F' U' D2 R' U R D' F' L F R' B L2 U2 F2 U' D | 20090308 |
11 | 7.16 seconds | Phil Thomas | first time using Jason's scramble | 20080423 |
12 | 7.20 seconds | Charles Huynh | It took a few tries. I was trying to finger trick some of the turns and as a result, my first few tries had pops. | 20080626 |
13 | 7.31 seconds | Milán Baticz | U B' F' D' R U L' U L' D' U B D F2 U F' R' F L2 B' R U2 R' F D'. Practise practise practise. | 20080710 |
14 | 7.91 seconds | Michal Robaczyk | Yeah | 20061218 |
15 | 8.32 seconds | Andy Thich | me best record | 20070924 |
16 | 8.69 seconds | Michael Atkinson | Using Jess Bonde's Ultimate Rubiks Cube Timer, I just start the timer and perform the random scrambling algorithm there. I know I'll be able to break 8 seconds, at least..probably even better than that though. | 20050610 |
16 | 8.69 seconds | Hiroyuki Take | n/a | 20070212 |
18 | 8.78 seconds | Thomas Watiotienne | Not very interesting | 20070721 |
19 | 9.01 seconds | Chris Wilkinson | so close to sub 9 o well still a good time | 20090510 |
20 | 9.09 seconds | Shinichi Kajita | L' F' R L2 F2 D' L' B L' U' L2 F2 R' L' F B D F' U' F L2 R2 F2 U2 R' | 20081231 |
21 | 9.39 seconds | Craig Bouchard | Bah.this is harder than it seems.17th PB for the day. | 20060316 |
22 | 9.43 seconds | Tyler Yarnelli | Took me a bit to get sub-10 | 20090510 |
23 | 9.49 seconds | Bob Burton | I only tried this a couple times and was waiting for a sub-10. Visit my site. | 20060518 |
24 | 9.80 seconds | Isaac Firesmith | this is a wierd catagory | 20070222 |
25 | 10.27 seconds | Davide Macri | good | 20081012 |
26 | 10.47 seconds | Josh Berg | yay first time trying | 20080424 |
27 | 11.71 seconds | Aaron McGhie | This was about my 3rd try. I did like 8 attempts but then I noticed that every attempt was nearly the exact same time so I quit. | 20070709 |
28 | 11.88 seconds | Arthur Adams | Need a better cube for this. I tried it! | 20061218 |
29 | 13.77 seconds | Alfred Ferwerda | n/a | 20070821 |
30 | 13.91 seconds | Anthony Benis | Well, I was never very good at scrambling. | 20070215 |
31 | 14.53 seconds | John Shephard | I have never really tried this until I saw this category. This is a result of my second attempt at this. | 20070623 |
32 | 15.13 seconds | Nicholas Neck | Just For Fun | 20071015 |
33 | 15.53 seconds | Lucas Garron | I'm still way too slow. Arthur should try this. | 20061016 |
34 | 16.12 seconds | Ryan Jew | I used Jnetcube. I tried quite a few times and i finally got a pretty good time Scramble: R2 L F2 U' F D F' B D' B F R2 F R D R U2 D2 F2 R' F' U2 R U2 R' | 20080415 |
35 | 16.75 seconds | Andrew Roley | where f(x)= (x^2+1)/2, If x is 11 (prime), f(x) is prime, as well as f(f(x))), f(f(f(f(x)))), f(f(f(f(f(f(f(x))))))), and possibly f(f(f(f(f(f(f(f(f(f(f(x))))))))))). The number of times the function is used is 1,2,4,7,11, respectively. The number of composites between each of these primes is 0, 1, 2, and 3, respectively. Unfortunately, It would take hundreds of computer years to see if this pattern went any longer. | 20070405 |
36 | 17.89 seconds | Jacob Wildes | This is stupid. maybe it's because I'm very slow. | 20070127 |