#### Athefre

##### Member

- Joined
- Jul 25, 2006

- Messages
- 1,184

How would one go about recognizing CLL+1 after recognizing the CLL case? Like what exactly would I look for on the scramble B2 R F2 R B2 L' B2 R D2 R B' L B2 R F2 R' B? Would the recognition be significantly harder if CLL+1 was done entirely with cycle unions and without the orientation trick? Depending on how easy the recognition is, I might start learning this set.

The idea is to recognize as ZBLL. There are a few ways of doing that. I'm not yet sure which is best for CLL+1. During development I was mentally flipping edges, but maybe there's a better way. I talked a bit about recognition before, but it's definitely something that could be developed. I'm also curious about how recognition will work once the orientation trick is removed. It may be that it is fewer cases but more difficult recognition. Or recognition may turn out to be pretty much the same. I'll have to finish it and examine the unions to really know.

For the scramble: After identifying the corner case, I would see that RU matches RFU and FU matches URF. For this case I would know that the edge at UR will be solved. That edge is oriented, so the alg is U R U2 R2 U' R U' R' U2 F R F'. This is how I was recognizing during development tests. I'm not an experienced ZBLL user, so I'm sure there are better ways.

Also a note on anyone who wants to contribute to the algs: cycle unions are not needed to generate algs if the orientation trick is used. To generate the algs for a specific CLL case, find two algs for that CLL case where applying the inverse of one algorithm then solving the corners with the other algorithm leads to an ELL case with exactly one solved or flipped edge, then find the two algs that are a 4-flip away from the original two. For example, for the Sune pure twist case, I found R U R' U R U2 R' and r' R2 U R' U r U2 r' U M'. Applying R U2 R' U' R U' R' then r' R2 U R' U r U2 r' U M' leads to an ELL case with exactly one flipped edge, so we know this pair works. Then I found F R U R' U' F' R U R' F' U2 F R U' R' and R' U2 R2 U R2 U R U' R U' R' which are a 4-flip away from the first two cases.

This is an interesting way of finding the algs. Pretty cool. In the conversations I had with TDM, he also had his own way of finding algs. His rule was that the second alg in the pair needs to be a 3-cycle difference from the first alg in the pair. I have already provided all of the possible combinations in the development files of the original post. No one has to use cycle unions anymore for CLL+1. All that is needed is to check the document, set up the corner case in CubeExplorer, and set it so that it will cycle the edges the desired way. All of the cases are in the document. So there's no need to find algs. They only need to be generated.

Well, I say that cycle unions doesn't need to be used anymore for CLL+1. However, I would like to get rid of the orientation trick and see how well it works. I have the first half of the cycle simulator built in Excel. It's just a matter of finding time to get it finished. 2,300 cycle simulations per CLL case.