Random Blindfold Cubing Discussion

and what approach is that

I forgot - I don't know if Chester has ever posted it. He sent out an email to a few of us where he categorized all the BH algorithms into some incredibly small number of cases; the idea is that you learn the letter pairs that go with each of the (something like 17) cases, and then you can learn the whole thing very quickly. It all looked quite promising, but since I've already learned them, I'm not sure if it's worth my time to go that route. Perhaps we can coax Chester into properly publishing it now.

The truth is that anyone who learns BH eventually gets where they see things pretty much this way, but by actually codifying it, it seems like it should be that much easier to learn.
 
I assume we're talking about 3x3 here

1) BH

2) My average is ~1:25 right now (with ~45-50 second memo times)

3) with fast memo and solving phases, I think sub-40 is possible.

4) BH, but with speed optimizations for the slower cycles. (Strict move optimal BH for 4x4 and 5x5 though).

omg that's totally how "freestyle" should be called. Perhaps something like F3-cycle? Or simply free-3-cycle I guess, that's what I'm calling my method from now on <3

I like this name as well. Perhaps it can be shortened to just F3 in situations where the context is clearly understood, or Free3.
 
1. M2 for edges and Old Pochmann for corners.
2. I average around 3:30-4:30.
3. I don't think sub 1:00 is even hard for some people with this method, but I don't know what the limit is.
4. I recommend Old Pochmann for beginners, M2 for a quick improvement, and BH for advanced solvers.
 
omg that's totally how "freestyle" should be called. Perhaps something like F3-cycle? Or simply free-3-cycle I guess, that's what I'm calling my method from now on <3

Alex's post made me think of "threestyle" which sounds kinda cool too. :p
 
1. Old Pochmann (Just starting to experiment with M2 edges but 1st success was not much more than a week ago)
2. 5m (Only 5 successes to date so still taking it slow - over concentrating on memo and execution)
3. 1m30s
4. Old Pochmann
 
What algorithm do you use for the threecycle UF FD LF?

Earlier I would've used M D' L D M' D' L' D, but today I found that you instead could do u' R u M' u' R' u M , or notated without wide moves D' F D M' D' F' D M. This is a totally new way to do edge commutators for me! Do you use it, and for what cycles?
 
What algorithm do you use for the threecycle UF FD LF?

Earlier I would've used M D' L D M' D' L' D, but today I found that you instead could do u' R u M' u' R' u M , or notated without wide moves D' F D M' D' F' D M. This is a totally new way to do edge commutators for me! Do you use it, and for what cycles?

Oh wow! That seems like the same technique as used in the x-center pseudo-slicing cycle: Ubl -> Ful -> Rbu

I had never thought to do pseudo-slicing on 3x3x3, that's very cool! I wrote up a post on how pseudo-slicing works here.
 
Hadn't really thought of that before.

(u' [R, U M' U'] u) and (u' [R, u M' u'] u) give the same solution but the second cancels nicely with the u' setup in this case (another way of looking at it). Interesting...

EDIT: This is pretty cool. I think I'll start using this actively for cases such as [M2, u R u'].
 
Last edited:
Back
Top