alexc
Veteran
Why not try TuRBo?![]()
Oh, I didn't think of that. It's kind of a lot of algos to learn and I don't know if it will be any better than R2.
Follow along with the video below to see how to install our site as a web app on your home screen.
Note: This feature may not be available in some browsers.
Why not try TuRBo?![]()
What does BH stand for?
Guessing "Beyer-Hardwick", maybe? Maybe this is the optimized commutators method?
Why not try TuRBo?![]()
I tried out some methods. I am pretty sure I will still use 3 cycle w/ visual memory as my regular blindsolving method. For multi, I will use either commutators or just set up the pieces in A perms, etc. I tried a few sighted solves. I mostly used A perms, but I occassionally threw in an easy commutator. I really like commutators, but I have trouble doing them when the interchangeable slice isn't U or D. Using free setups with A perms was also good. The setup moves were sometimes short, but sometimes long, too. I think that I will use A perms or other corner algs when the setups are good, and use commutators when the setups are bad. Lastly, does anyone know good algs for the following corner cycles: (1 3 7) (5 7 3) Thanks!![]()
Nice Joel, check this one out:
L2 U [R2 U L2 U' R2 U L2 U'] U' L2
Hence:
L2 U R2 U L2 U' R2 U L2 U2 L2, it's optimal in HTM, and pretty nice considering its RLU
That's 12 Moves though. It's a good substitute though. I'm actually amused by Joel's solution.
How does the Turbo method work?
I've been developing a new system of my own -- it still has a few kinks to work out, but I've been able to get very good times with it. It is inspired by freestyle commutators but perhaps more braindead in nature. I've always had trouble finding a good method that is both fast and effective and yet easy to compress down in memory and easy to unpack. Does Turbo solve these issues?
Kai, will you switch to TuRBo?
It's also a pure commutator: [R2, U L2 U'].<U'R2U, L2> = U' R2 U L2 U' R2 U L2. So R2 U L2 U' R2 U L2 U' is just a shifted commutator...
It's also a pure commutator: [R2, U L2 U'].<U'R2U, L2> = U' R2 U L2 U' R2 U L2. So R2 U L2 U' R2 U L2 U' is just a shifted commutator...
Pochmann is nice, but the move count is just way too high to reach acceptable speeds.
R2 is faster, but you're right, you do need to learn several algorithms.
3-cycle is fast, but again, for multibld you need to memo twice as much.
Really, I can't decide for you. I've just said what I think.