I DID IT!! Finally!! It felt sooo good! I think the reason I was able to do it this time is because the edge permutation was reeaally easy. So it only took me...
Hey everyone. So yeah, I just felt like posting some of the algs I use to see if anyone has any better ones, and also to see if anyone likes any of these. I...
hi, i'm new in this group, i actually solved the cube blindfolded just few days ago. now my biggest problem is memorizing the cube fast. i actually wonder how...
Hi Chris, I don't have much to offer for corner orientation algs. I really only use one alg plus a multitude of inverses/reflections for all my CO needs. It...
Hey everyone, I've been wondering lately about lucky cases in blindfold solving. What should we consider "too lucky" for purposes of posting on the unofficial...
I seem to use an alg that I haven't seen anywhere....It may be long but super easy to memorize and super fast to execute: (L2 U) (B2 U')*2 (L2 U) (B2 U B2 U') ...
Hi friends, So which do we have? Corner permutations: R'FR'B2RF'R'B2R2 (basic + inverse) (L2 U) (B2 U')*2 (L2 U) (B2 U B2 U') [RB'R'B]x3 (13)(27) UL2UR2...
Hi, I am not really an expert with BLD cubing, but maybe this helps a little bit. I recently began with memorizing the positions of the pieces in a diffenrent...
(RB'R'B)3 U2 R2B2RFR'B2RF'R U2 ... From: "brokulo" <brokulo@...> To: <blindfoldsolving-rubiks-cube@yahoogroups.com> Sent: Sunday, April 04, 2004 9:51 PM ...
Hi,,.... I'm not quite the expert either...:-/, but what other way is there besides the cycles? Is that Dr. C's way? .... if so, how is that way done? -bm ...
Dr Carr's method is the 'piece by piece.' Basically it's what it sounds like: you go piece by piece. I used to do the corners like that. I would get all the...
One algorithm that I often use is from Richard Carr's document: R'D'LDRD'L'DUL'UR2U'LUR2U2 You hold it so there's a corner with orientation 2 in position UFR, ...
(D2 B2 D B2) puts DBR and UBR both in the U layer so now the cycle is (UFL UFR) (UBL UBR) so use your normal permutation alg, then (B2 D' B2 D2) undoes the...
... In case you cared to know for sure, you're correct. I had written this into a program a bit ago and this is from the output - # of edge orientation states...
... I would do: 1) Permute UFL -> UFR -> UBR with (R B') (R F2) (R' B R) F2 R2 2) Permute UBR -> UFL -> DBR with [(R'B R B')*3 U2]*2 An explanation of this...
Hi, I am not really an experienced blindfold cuber, but I've done it a couple of times now. I have seen video's of people doing it really fast... It takes me...
Two more ideas: 1) Setup algorithm (D' L2 D L2), Permutation algorithm (R B' R' B)*3. 2) Swap (UFL,URF) and (UF,UB) using your PLL alg for this case. Then use...
For Jim Mittan style (had a 1:15 recently (http://www.speedcubing.com/chris/overall.html) plus some time for memorization/planning) read his recent posts in...
... Can you tell us what these 13 states are? ... though ... when ... Hmm, maybe a simple greedy algorithm could work... but I haven't tried it yet, this is...
How fast can you execute this? Some time ago I found that you can get the same using a "double Sune", i.e. (L' U' L U' L' U2 L) (R U R' U R U2 R') This will...
Hey, After a bit more thought, here's my latest attempt at a definition. A blindfold solve shall be considered lucky if any one (or more) of the following...
I agree, all these algs are fast... but I think, ... the fastest way is just looking and planning ahead w/ nonstop, as ron says: "just simply looking ahead...
... I would have to agree that this defines a lucky case - several of those items on their own would actually define a very lucky case. For example, having all...
... Hmm... I sent a response to this yesterday, and it doesn't appear to have gone through - I'll repost. Not surprisingly, the 13 states are superflip along...
Hi friends, I would say: 1. More than 5 (instead of 4) corners are correctly oriented 2. More than 8 edges are correctly oriented 3. More than 3 (instead of 2)...
Having problems with message search?
Fill out this form to ensure your group is one of the first to be migrated to the new message search system.
