If you accept that it's possible to perform R U in under three seconds, then you have to accept that it is possible. There is a small, but non-zero chance of a two-move scramble appearing at a competition, which makes it, by definition, possible.
By the way, I like the video a lot :D
I used something like this: (slightly differently as I used the obliques in the back right corner as buffer)
3-3Rw' B2 2-2Uw2 B2 3-3Rw (U2) 3-3Rw' B2 2-2Uw2 B2 3-3Rw
I am using something similar for T-centers on 5x5.
This is the right step, even though it will cause a lot of hate for the WCA. Speedcubing is becoming more mature, and absurd events like magic and feet solving are a relict from the early years. Especially feet has made competitions look really weird, because it is the kind of thing that stands...
I've just tried it and it works really well! I've done 20 solves and it always correctly detected when the cube was solved. (With https://hakatashi.github.io/smart-cube-timer/ sometimes the cube is solved, but it is not detected.)
My preferred settings are the two second delay. I like that...
r U l z // f2c
r U r' U' x // yb
U' r' U r U' r' x L' U' x' // yr
U (2-2l2') U' x' // yg
U2' r U r // blue
3r2 U r2' U' r2 // orange
3r' U r U r' // red / green
3r r U' R' U r' R2 U2 z' D2 // yo
U2 F R' F' R u' R U' R' u// rg
u y' R U R' y // rw
y u2' // go
y' R' U' R u // rb, ob
R U' R' U R' U'...
1. the M2 part doesn't affect the corners.
2. You have to break into a new cycle (swap the buffer with some unsolved piece and continue until you get to the buffer again)
3. Don't remember the cube as pieces but as stickers, then this isn't an issue.
I suggest watching a couple of tutorials /...
Yes.
Other than that, it's often the little things that help a lot. Whatever you find in walkthrouh solves, reconstructions etc. that may make you a bit more efficient.
I think Ortega is faster than (only using) CLL. It is much easier to 1-look, and you can incorporate CLL/EG algs in any order.
My tips for Ortega:
- know which PLL you build on D when you solve the face (yoo probably already do that)
- try to solve the face in such a way that you don't have to...
Here's a very simple command-line solver for Windows:
https://www.jaapsch.net/puzzles/square1.htm
(The optimal one)
I'm not much of an expert, but you can probably write a program to list all 6!*3!=4320 cases (ignoring AUF) as strings (format as described in the readme) and write them into a...
I guess most of the time you would cancel into the R2 of the H-perm as well, so it's even better.
Also it seems unlikely that you would find 6-move insertions for both 3-cycles.
I'd try to insert R2 U2 R2 U2 R2 U2 or M2 U2 M2 U2 :) (Maybe with some setup moves)
I haven't thought about it too much, but doing 2 insertions seems not worth it.
I've always done it like that, I guess I'm smart, too :cool:
But I will usually just assemble it with the 3x3 pieces solved, which is only a little bit of sorting.
I go through the skeleton from right to left and only check whether the first move of the commutator can be the current skeleton move to the left. This is equivalent to only checking each second spot as you suggest, and it is really fast because you always know with which move your commutator...