• Welcome to SpeedSolving.com — the world’s largest puzzle community!

    You’re currently browsing as a guest, which means you have limited access to discussions, resources, member profiles, and community features.

    Join 50,000+ cubers and puzzle enthusiasts from around the world to ask questions, share solves, improve faster, and be part of the community.

    Registration is free, fast, and easy — create your account today.

    Already a member? Log in here to hide this message and start participating.

Official Blindfold Algorithm List

Status
Not open for further replies.
I've been talking to Joey and Ville and asking what they use for certain cases. Here are a few I hadn't seen before:

ULB -> DRB -> DLF (from Ville) This comm has some nice cancellations in either direction:

y R' U R [R U' R', D2] R' U' R

Joey showed me that (R' U R U')*3 can also be useful for insertions, for example:

ULB -> DRB -> DLF (same cycle as the one above):

[L2, (R' U R U')*3]

ULB -> RUB -> FRD:

y [(R' U R U')*3, F2]
 
I've been talking to Joey and Ville and asking what they use for certain cases. Here are a few I hadn't seen before:

ULB -> DRB -> DLF (from Ville) This comm has some nice cancellations in either direction:

y R' U R [R U' R', D2] R' U' R

Joey showed me that (R' U R U')*3 can also be useful for insertions, for example:

ULB -> DRB -> DLF (same cycle as the one above):

[L2, (R' U R U')*3]

I think the following is pretty good for ULB -> DRB -> DLF. I tend to be biased towards fewer moves in most cases, which isn't always faster. But in this case I think the optimal length alg is still pretty darn fast:

ULB -> DRB -> DLF : L2 U' r2 U r2 U L2 U' r2 U' r2 U
which is made up as [L2, U' r2 U r2 U]

Chris
 
It's hard for me to see how 26 moves could be faster than the usual 12.

But since there are only 3 or 4 different possible version of that position, it wouldn't be wrong to learn a really fast algorithm.

Do Ville and Joey use those, or was it just curiosa?

Chris: Don't you use UBR as (main?)-buffer? If so, do you mirror B/F or R/L?
 
Last edited:
It's hard for me to see how 26 moves could be faster than the usual 12.

But since there are only 3 or 4 different possible version of that position, it wouldn't be wrong to learn a really fast algorithm.

Do Ville and Joey use those, or was it just curiosa?

Chris: Don't you use UBR as (main?)-buffer? If so, do you mirror B/F or R/L?

Ville uses the one he showed me. Joey did use the (R' U R U')*3 one but I think he's going to use Ville's now after he showed us in IRC.

Very interesting that you reflect the algs if ULB is solved, Chris. Personally I think that would slow me down as I am slowly compiling a list of speed optimized corner comms/algs.
 
It's hard for me to see how 26 moves could be faster than the usual 12.

But since there are only 3 or 4 different possible version of that position, it wouldn't be wrong to learn a really fast algorithm.

Do Ville and Joey use those, or was it just curiosa?

Chris: Don't you use UBR as (main?)-buffer? If so, do you mirror B/F or R/L?

Ville uses the one he showed me. Joey did use the (R' U R U')*3 one but I think he's going to use Ville's now after he showed us in IRC.

Very interesting that you reflect the algs if ULB is solved, Chris. Personally I think that would slow me down as I am slowly compiling a list of speed optimized corner comms/algs.

That's so great! I'm trying to do the same thing with edges, but it's very hard. You're planning on publishing it when done?
 
Cyclic shift I found:

R' [U', R' F' R2 F R] R --> R' U' R' F' R2 F R U R' F' R2 F R2

I prefer it to the optimal cyclic shift algs, especially for this angle.

It's hard for me to see how 26 moves could be faster than the usual 12.

But since there are only 3 or 4 different possible version of that position, it wouldn't be wrong to learn a really fast algorithm.

Do Ville and Joey use those, or was it just curiosa?

Chris: Don't you use UBR as (main?)-buffer? If so, do you mirror B/F or R/L?

Ville uses the one he showed me. Joey did use the (R' U R U')*3 one but I think he's going to use Ville's now after he showed us in IRC.

Very interesting that you reflect the algs if ULB is solved, Chris. Personally I think that would slow me down as I am slowly compiling a list of speed optimized corner comms/algs.

That's so great! I'm trying to do the same thing with edges, but it's very hard. You're planning on publishing it when done?

Definitely. I might use it as an excuse to make my own website again and document my cube algs among other things. Although corners is easier IMO since most of the speed optimal ones are still comms, as opposed to a lot of the edge algs.
 
Last edited:
Hi,
Does anyone knows the fastest algs for flip UR-UR? I've search with cube explorer but somehow it goes really slow. Thx
 
I'm looking for some nice 5-cycle algs for EP, i've got already these three:
(B2 R2’ U R2)*2
(R2’ U R2 B2)*2
(R2 B2 R2 U)*2
Do you have any more stuff like this:)
 
( (M'U)*2 (M'U')*2) )*3 M2

Does anyone have a good <MU> alg to solve this?

EDIT: M' U' M' U M' U2 M U M U M U2 M' U2 M' is slightly better...
 
Last edited:
Last edited:
Status
Not open for further replies.
Back
Top