![]() | Square-1: Blindfolded |
Place | Result | Name | Quote | Date |
---|---|---|---|---|
1 | 13 minutes 43.32 seconds | Lucas Garron | I took about 9:45 to memorize (to make it fair, I used Stefan's scramble). Basically, once square I use only a two-corner cycler, and a two-edge switcher; they're the only algorithms I trust while I'm blindfolded. Did this right after a 7:31.65, starting square. I plan to eventually devise a full method for memorizing from any shape, and learn every type of two-cycle, with a few three-cycles. | 20060822 |
2 | 16 minutes 32.59 seconds | Andrew Nelson | Did the same scramble as Stefan and Lucas (fairness, etc) Figured 4 moves to solve cubeshape except for 2, which I fixed with a J perm. Traced all edges through that, figured out a nice freestyle solution. [team #] | 20081231 |
3 | 27 minutes 15.05 seconds | Evan Ralston | Scramble: (4,5)(0,6)(0,3)(3,3)(0,3)(3,1)(-1,5)(0,1)(0,1)(4,0)(6,4)(2,2)(6,2) (0,4)(-2,0)(0,4)(2,0) About 21 minutes of memorization. I used 2-corner switch, 2-edge switch and 3-edge cycle as they are the only algorithms that I am 100% confidant of while blindfolded. I am still working on faster memorization time. | 20080626 |
4 | 41 minutes 31.15 seconds | Stefan Pochmann | Includes 17-18 minutes analysis/memorization. I've been thinking about this a while ago and now that I saw the rubiks.has.it thread I just gave it a try. Went to Jaap's page and used the first scramble, turned out to be a fairly nice one: -2,0/0,-4/0,3/0,1/6,2/6,0/6,3/-3,1/5,5/6,1/-1,2/0,4/6,2/0,1/0,5/0,3/3,0 [I want a flying pony] | 20060628 |