to recognize a pure commutator you use "So, in a Pure commutator, the first thing we are going to look for is two pieces that are interchangeable. Not only that, but those two pieces NEED TO BE on a different layer as the third one."

for an A9 you use 'An A9 can be used when you have two interchangeable pieces, but either there's a piece already in that layer, or there is no 3-move insertion (A) part."

but how can you tell if there is a 3 move insertion?
 
Sort of by practiced intuition. It's not geometrically obvious without having done pure commutators many many times. Unlike all >9-movers, A9s and Pures are the hardest to detect in the sense that they are not geometrically obvious. However, you will be able to tell if there is a 3-move insertion more or less by knowing the cases in your head.
 
Sort of by practiced intuition. It's not geometrically obvious without having done pure commutators many many times. Unlike all >9-movers, A9s and Pures are the hardest to detect in the sense that they are not geometrically obvious. However, you will be able to tell if there is a 3-move insertion more or less by knowing the cases in your head.
oh so after time I will just know? I was asking because i thought that there might be some trick to know if there is a 3 move insertion.

EDIT: how do you recognize a case where you use columns?
 
Last edited:
oh so after time I will just know? I was asking because i thought that there might be some trick to know if there is a 3 move insertion.

EDIT: how do you recognize a case where you use columns?

For columns, you will have an AnI pair and one of the pieces in the pair will be interchangeable with a piece outside of the pair by a 180deg turn.
 
For Old Pochmann, using image pairs for memorization, I don't get what you do when you break into a new cycle. When you're doing memorization, do you plan when you will get the case to break into a new cycle? and then you just memorize that is "break into a new cycle" by switching it with a piece that you know isn't solved? Sorry if this question is apparent, I'm new to BLD, so yea... Thanks.

EDIT: This is for edges, but is it the same for corners too? Thanks.
 
Last edited:
In BLD solves, you always solve in cycles (unless you include speedBLD ;)). What people mean by "breaking into a new cycle" is to choose an arbitrary piece that you haven't planned to solve yet and to solve for that one whenever your buffer is solved.

For example, suppose you have UBL as your buffer and you memorized to solve UFL -> UFR and the piece at UFR solves to UBL. So I'm going to break into a new cycle: that is, I will arbitrarily pick a piece, say UBR and solve for that one. Then continue. So you have UFL -> UFR -> UBR -> ... -> UBR. And the end of your cycle should get you back to UBR.
So in your memo, you plan the entire solve. During your execution, all you care about is solving the exact sequence that your memo tells you to.
 
In a few weeks I'll be switching to edge comms (well, I have a comp in a month so I don't know what I'll do up on stage), but regardless, which buffer should I pick? DF or UF? I heard UF has more fast cases, while DF is nice for M2 transitioners.
 
a U sticker no doubt, I use UB and UBL buffers cause this way is easy to solve the parity with OP
 
Just play around with edge comms first and see what you like. You don't really need a "transition" if you already know BH corners. Nevertheless, I'd recommend playing with BH edges using DF first, and then moving to one of the U edges. Switching edge buffers is as difficult as switching corner buffers for comms (which isn't hard at all).

Also, note that if you do use DF, you may actually do some M2 comms which turn out out to be optimal. :)
 
Probably the one thing that gives you an edge with UF buffer is using <R,U> algs, but those can be tedious to learn. A lot of them are setups to U perms, etc with cancellations, but to execute them quickly you need to get them into muscle memory.

I think the difference is pretty negligible, as Aron has already done a sub30 average of 5 with DF buffer. (That is UWR, right?)
 
Well Mike, I just tried memoing corners, literally just saying the letters I have to memo, no effort in trying to remember. Memo'd in under 8 seconds, put on blindfold, could only remember first letter, everything else was gone.

Fun fact, just memo'd/executed corners via Y perms. And it took 31 seconds. Good starting point (that was a semi nicecorner scramble, just 7 letters).
 
Last edited:
in Bh pure commutators, is there an easy way to tell if you need to insert first or interchange first?

I do something I call "Put it where it needs to go first"

Let's assume A, B and C are the 3 pieces you need to cycle. A and B are the 2 pieces which can be swapped with the interchange move, and C can be inserted where A is at the moment. if the cycle is A->B->C->A, do insertion first (C needs to go where A is, so put it there); if the cycle is C->B->A->C, do interchange first (B needs to go where A is).
Sorry for the language, I'm not used to talk about commutators (or other cubing stuff) in English, I hope you understood.
 
Back
Top