- Dec 11, 2009
Does anyone know what the briefest algorithm known to man is for the diagonal winged edge swap (pure form) in BQTM? (See sketch below).
I just need to know how many BQTM it is, not the algorithm itself or any other move measurements...
Why are you asking this here anyway? This edge swap is 1/2 of a PLL parity fix, and is just a NO-OP for fixing OLL (dedge flip) parity. Since the dedges need to stay together, the other edge pieces in your diagram will also have to swap as well. This amounts to two (an EVEN#) of 2-cycles, which will not change the OLL edge parity at all.
This thread is seeking some NEW and better ways to bring edge parity (OLL dedge flip) back to even. If you want to be helpful, please find some algs that are ODD#'s of even-cycles of edge pieces (that also keep the dedges paired). The pure parity alg is only one way of doing this, and does in fact fit the criterion for this problem, since it IS an odd#(1) of a 2-cycle of edge pieces. The problem with the pure parity alg, is that it has the most constraints (requiring all pieces to be placed exactly), and is therefore the most difficult to achieve. Finding OTHER algs that perform and odd# of even-cycles of edge pieces(while keeping the dedges paired, but not necessarily restoring everything else),will make for some NEW approaches to solving edge parity(OLL,dedge flip). Can you find some of these NEW algs?