Wings BH: how do you perform
DFr > UFl > URf?
or
DFr > UFl > ULb?

For the first one, I'd do U' r2 D R2 D' r2 D R2 D' U
[U' [r2, D R2 D']]

For the second one: U r2 D' L2 D r2 D' L2 D U'
[U [r2, D' L2 D]]



With commutator notation, do you write the interchange move first in the brackets, or second (i.e., did I write those comms up there properly?)
 
Hey guys.
I need a new algorithm. Does anyone know any better algorithm for this one:

F R2 F L2 F' R2 F L2 F2

Best would be an algorithm with R turns. But any better algorithm than this is fine.

And i have another one. I think that this one is ok, but not that great. So IF somebody knows another algorithm for this seconds case, it would be great, even if the one is more important right now:

L2 F2 L B2 L' F2 L B2 L

Thanks, Dennis
 
Hey guys.
I need a new algorithm. Does anyone know any better algorithm for this one:

F R2 F L2 F' R2 F L2 F2

Best would be an algorithm with R turns. But any better algorithm than this is fine.

And i have another one. I think that this one is ok, but not that great. So IF somebody knows another algorithm for this seconds case, it would be great, even if the one is more important right now:

L2 F2 L B2 L' F2 L B2 L

Thanks, Dennis

For those cases I usually use a one move setup into my noobish BH algs. I don't really like them but maybe you will?

1) x' D [R2 , L U L' U'] D' x

2) R' [D' R' D R, U2] R
 
Last edited:
For those cases I usually use a one move setup into my noobish BH algs. I don't really like them but maybe you will?

1) x' D [R2 , L U L' U'] D' x

2) R' [D' R' D R, U2] R

I need the algorithms for TuRBo, so i already use setup moves, so i guess another setup move would just confuse me.
But thanks anyway!

Greetings, Dennis
 
F R2 F L2 F' R2 F L2 F2
Wow. I can't believe you would think that's a bad algorithm; I think of it as a nice, very fast BH algorithm. Although I do execute it as x' D R2 D L2 D' R2 D L2 D2 x.
L2 F2 L B2 L' F2 L B2 L
Again, I execute that as x' L2 D2 L U2 L' D2 L U2 L x. It's even faster than the other one.

Note that these are two BH algorithms that you already know. :)
 
Wow. I can't believe you would think that's a bad algorithm; I think of it as a nice, very fast BH algorithm. Although I do execute it as x' D R2 D L2 D' R2 D L2 D2 x.

Again, I execute that as x' L2 D2 L U2 L' D2 L U2 L x. It's even faster than the other one.

Note that these are two BH algorithms that you already know. :)

Well, i also execute the last one, like you do. And i like it. Thats why i said, that its not very important to get a new one for this one. About the first one: I dont even like that one, when i execute it like you do. Too many switches from right to left.
I like the new one much more :) Yeah, i know 18 BH algorithms at least :D (only 360to go..ridiculous).

Greetings, Dennis
 
I'm learning BH corners, and right now, I'm on pure 8-move commutators. Are these all of the 3 move insertions for BH corners, of only putting the buffer (UBR) into other interchange layers? Or am I missing some? If I'm not, then does than mean there are no 3 move insertions to put the buffer into the D layer, with the interchange being in D stickers, not just the D layer?

UBL - B' R' B
UFR - R B R'
LBD - D R D'
LDF - F D2 F'
LFU - L' B L
FDL - L' U2 L
FUL - F R' F'
FDR - D B' D'
RDF - F' U F
RBD - R' U' R
BDL - L U' L'
BDR - B U B'
DFL - D' B2 D
DFR - D R2 D'
EDIT: Found:
L B2 L' and F' R2 F
EDIT again, found: U R U' and U' B' U

Thank you very much.

EDIT:

On http://speedcubing.com/chris/bhcorners.html, it says "The case name is more important for each algorithm than the given algorithm. In later pages to follow you will see how to use the case name for a certain cycle to construct the correct algorithm when solving." Does anyone know where this page is? I can't find it.
 
Last edited:
Does than mean there are no 3 move insertions to put the buffer into the D layer, with the interchange being in D stickers, not just the D layer?

This is true. Most people do a 5 move insertion like R2' U R2 U' R2' when the D-layer stickers are diagonal and a setup to an R2 interchange (R2 U' L2 U R2 U' L2 U) when they're adjacent. Hopefully you also know to use comms where the buffer is part of the interchange. Looks like you're on the right track though.
 
This is true. Most people do a 5 move insertion like R2' U R2 U' R2' when the D-layer stickers are diagonal and a setup to an R2 interchange (R2 U' L2 U R2 U' L2 U) when they're adjacent. Hopefully you also know to use comms where the buffer is part of the interchange. Looks like you're on the right track though.

Thanks, but for R2' U R2 U' R2', that brings UFR to the D (sticker) layer, which isn't my buffer. And, yes I also know the pure comms when the buffer is part of the interchange, I just wanted to make sure I got these ones down perfectly first. I will probably ask another question soon if I have all the 3 move insertions putting a piece into the buffer/other piece later.
 
Thanks, but for R2' U R2 U' R2', that brings UFR to the D (sticker) layer, which isn't my buffer. And, yes I also know the pure comms when the buffer is part of the interchange, I just wanted to make sure I got these ones down perfectly first. I will probably ask another question soon if I have all the 3 move insertions putting a piece into the buffer/other piece later.

I use UBL as my buffer so I always do a U2 when that comes up. It's not very efficient, but it's ergonomic and simple.
 
I use UBL as my buffer so I always do a U2 when that comes up. It's not very efficient, but it's ergonomic and simple.

Okay, that was what I was thinking, but I wasn't completely sure. I like it though, I think I'll use it (unless the swap is DFR><DLF) Thanks for all the help, I feel I like I'm making a lot of progress actually. Learning that one algorithm took away a few more algs I would've had to learn, now I can solve any D-sticker swap!

Edit: Congrats on the 31.02 you just got, and the 47.88 officially too. You can NR... and NAR soon! (and WR?)
 
Last edited:
On http://speedcubing.com/chris/bhcorners.html, it says "The case name is more important for each algorithm than the given algorithm. In later pages to follow you will see how to use the case name for a certain cycle to construct the correct algorithm when solving." Does anyone know where this page is? I can't find it.

Daniel and I intended to write the following pages at some point after posting the algorithm list. Sadly, neither of us really has time to do this now. Chester wrote up a thread on the forum that lists all the different cases (the true cases, factoring out reflections and transpositions and the like). Try searching for his thread and see if it helps.
 
Back
Top