LarsN
Member
I like to use COLL for my fridrich solves and I know that there are a few people out there who does too.
An argument not to use COLL is that COLL algorithms take longer to execute than the relevant OLL's. That's when an idea came to me...
What are the OLL's that most people hate. For me it's OLL's with no edges oriented correctly. Then I started to find different algorithms for the same OLL case with no edges oriented correctly.
Now I've found a full set of COLL algorithms that orients and permutes the corners of the last layer, and flips all four of the last layer edges. I call them CLLEF: "Corners Last Layer and Edge Flip"
So, is it worth it?
Compared to using COLL you have 40 cases to learn with CLLEF and COLL, recognition is also the same and the end result is an edge only PLL or PLL-skip.
CLLEF algorithms are longer than COLL on average, but that's not a fair comparison. Instead, COLL algorithms are longer then the respective OLL algorithms, but CLLEF algorithms are (so far) exactly 12.0 moves compared to 12.0 of the respective OLL's (taken from cubewhiz.com).
One negative point about CLLEF is that it is not very useful with other methods like Petrus og Roux.
I'm working on optimizing the CLLEF algorithms for speed but I'm almost done If anyone is interest in this I could add the algorithms to the wiki (under CxLL ?).
If this is just mad ramblings, tell me aswell.
An argument not to use COLL is that COLL algorithms take longer to execute than the relevant OLL's. That's when an idea came to me...
What are the OLL's that most people hate. For me it's OLL's with no edges oriented correctly. Then I started to find different algorithms for the same OLL case with no edges oriented correctly.
Now I've found a full set of COLL algorithms that orients and permutes the corners of the last layer, and flips all four of the last layer edges. I call them CLLEF: "Corners Last Layer and Edge Flip"
So, is it worth it?
Compared to using COLL you have 40 cases to learn with CLLEF and COLL, recognition is also the same and the end result is an edge only PLL or PLL-skip.
CLLEF algorithms are longer than COLL on average, but that's not a fair comparison. Instead, COLL algorithms are longer then the respective OLL algorithms, but CLLEF algorithms are (so far) exactly 12.0 moves compared to 12.0 of the respective OLL's (taken from cubewhiz.com).
One negative point about CLLEF is that it is not very useful with other methods like Petrus og Roux.
I'm working on optimizing the CLLEF algorithms for speed but I'm almost done If anyone is interest in this I could add the algorithms to the wiki (under CxLL ?).
If this is just mad ramblings, tell me aswell.