Weston
Premium Member
This might have been thought of before, but this idea occurred to me.
Some people use COLL for one handed solves so that they have an some sort of edge cycle as their PLL, which is very fast.
One down side of this is that the COLL algorithms are generally not as fast as the corner OLL algorithms because the corner OLL algorithms can be 2 gen and the for COLL, about 7/8 (and 3/4 of the H case) can not be 2 gen.
However, if instead of COLL, on the last layer with all edges oriented correctly, one performed an algorithm that oriented corners and permuted edges, it would be 2 gen. Then for PLL, you could have a skip, A, or E perm. A perms in my opinion for OH are pretty fast, but I haven't looked for a good OH E perm yet. I'm pretty sure there is one.
I'm not sure how many algorithms this would require, but if it isn't too many, I think it is a pretty good idea.
What do you think?
Some people use COLL for one handed solves so that they have an some sort of edge cycle as their PLL, which is very fast.
One down side of this is that the COLL algorithms are generally not as fast as the corner OLL algorithms because the corner OLL algorithms can be 2 gen and the for COLL, about 7/8 (and 3/4 of the H case) can not be 2 gen.
However, if instead of COLL, on the last layer with all edges oriented correctly, one performed an algorithm that oriented corners and permuted edges, it would be 2 gen. Then for PLL, you could have a skip, A, or E perm. A perms in my opinion for OH are pretty fast, but I haven't looked for a good OH E perm yet. I'm pretty sure there is one.
I'm not sure how many algorithms this would require, but if it isn't too many, I think it is a pretty good idea.
What do you think?