Actual CPEOLL

[Kirjava]

People used to call OLLCP-A "CPEOLL". This is a misnaming - we already have enough of these and I've decided that the subset is obscure enough to easily fix. I have modified the wiki to reflect this.

The actual CPEOLL subset does not preserve corner oprientation. I'm surprised that it doesn't exist yet.

I understand why though. Cubers seem to think that ELS and CPLS are a better way to reach 2GLL than LS and CPEOLL because they are blinded by the strive to find a good system for 1LLL and ignore problems CPLS has to forget that you don't *need* to influence LL during LS.

So just use it as a 2LLL system. Might be good for OH or something, I don't know.

There are 24 cases, you may already know all the algs - the subset can be learnt in under an hour.

Rob helped me find these.

[table="width: 100%, class: grid, align: center"]
[tr]
[td] [/td]
[td]

[/td]
[td]

[/td]
[td]

[/td]
[/tr]
[tr]
[td]

[/td]
[td] [/td]
[td]L' U R U' L U R'[/td]
[td]R' U' R U R' F' R U R' U' R' F R2[/td]
[/tr]
[tr]
[td]

[/td]
[td]R U R' U' M' U R U' r'[/td]
[td]U2 r U' r' U' r U r' y' R' U R[/td]
[td]F R U R' U' F'[/td]
[/tr]
[tr]
[td]

[/td]
[td]U R U R' U' M' U R U' r'[/td]
[td]U R U R' U' R' F R F'[/td]
[td]U F R U R' U' F'[/td]
[/tr]
[tr]
[td]

[/td]
[td]U r U2 R' U' R U' r'[/td]
[td]U' R U2 R' U2 R' F R F'[/td]
[td]f U R' U' R f'[/td]
[/tr]
[tr]
[td]

[/td]
[td]U r U R' U R U2 r'[/td]
[td]U2 F' r U r' U' r' F r[/td]
[td]U F U R U' R' F'[/td]
[/tr]
[tr]
[td]

[/td]
[td]r U R' U R U2 r'[/td]
[td]F R' F' R U R U' R'[/td]
[td]F U R U' R' F'[/td]
[/tr]
[tr]
[td]

[/td]
[td]r U2 R' U' R U' r'[/td]
[td]U' L' U2 L U2 L F' L' F[/td]
[td]U' F U R U' R' F'[/td]
[/tr]
[tr]
[td]

[/td]
[td]F R U r' U' R U M' R' U' F'[/td]
[td]F R' F' R2 r' U R U' R' U' M'[/td]
[td]L' U2 L F R U2 R' F' L' U2 L[/td]
[/tr]
[/table]

 

[mark49152]

This is great - I was looking for this the other day. If I'm not wrong, there are only 19 cases to learn, given that 6 of the diagonal swaps reduce to 2 through symmetry.

 

[yoinneroid]

This is great - I was looking for this the other day. If I'm not wrong, there are only 19 cases to learn, given that 6 of the diagonal swaps reduce to 2 through symmetry.

Well, you could go with 15 actually

 

[mark49152]

Well, you could go with 15 actually

Yes good point. And most of these algs are easy - this is a nice set.

 

[TheNextFeliks]

Nice algos. The ones on the wiki preserve orientation.

I like the idea of cpeoll. Would be really good for oh IMO since you have 2gll left.

 

[Sa967St]

Kir, what's your opinion on saying OELLCP instead of OLLCP-A?

 

[Kirjava]

Depends on the justification I suppose. I'm having trouble deciphering what it actually means at the moment.

I think it's a bit weird to be giving subsets of actual sets specific names, but I suppose CO solved is a bit different.

I honestly can't think of a better name than OLLCP-A without it being confusing. Don't get me wrong, I tried! A standard naming scheme was also considered.

 

[Username]

Can someone explain what CPEOLL actually does (orients and permutes)

 

[Kirjava]

solves corner permutation and edge orientation in the last layer

 

[antoineccantin]

I saw this a few months ago, but I have a couple issues with it:
- Recognition isn't very good. This combined with sometimes bad 2gll recognition would give many pauses during the last layer.
- Well, I guess that's it.

 

[googlebleh]

People used to call OLLCP-A "CPEOLL". This is a misnaming - we already have enough of these and I've decided that the subset is obscure enough to easily fix. I have modified the wiki to reflect this.

The actual CPEOLL subset does not preserve corner oprientation. I'm surprised that it doesn't exist yet.

Better amend the Wiki then. It defines OLLCP-A as "The subset [of OLLCP] in which all corners are oriented. Also known as CPEOLL."
http://www.speedsolving.com/wiki/index.php/OLLCP

Unfortunately, I can't change this 'wiki'. Does a mod have to do it?

 

[Kirjava]

- Recognition isn't very good.

Really? I don't seem to have any problem with it. Maybe using roux makes this much easier for me. It's certainly better than CPLS.

Better amend the Wiki then. It defines OLLCP-A as "The subset [of OLLCP] in which all corners are oriented. Also known as CPEOLL."
http://www.speedsolving.com/wiki/index.php/OLLCP

Fixed.

 

[StachuK1992]

Cubers seem to think that ELS and CPLS are a better way to..

Wait, do people actually use CPLS? Who uses CPLS?

Very cool

 

[elrog]

Anyone who does there research should know the difference, but this just makes it easier for them to find. Great thread.

 

[antoineccantin]

How exactly would you recognize the corner permutation for these? I don't quite know since when I recognize CxLL is don't do it by which pieces it swaps but using colour patterns.

 

[Kirjava]

uhm, personally I just find it intuitive - things just 'look swapped' to me

I guess you can learn which pieces colour patterns are swaps of

 

[antoineccantin]

f U R' U' R f'

This should be f R U R' U' f'

Also, could I put this on my site with some algs changed, for OH?

 

[Kirjava]

Also, could I put this on my site with some algs changed, for OH?

yeah just write "kirjava is cute" or something with it

 

[antoineccantin]

yeah just write "kirjava is cute" or something with it

Thanks.
https://sites.google.com/site/antoineccantin/oh/cpeoll

 

[ChickenWrap]

I have tried a bunch of these algs and while the idea seems nice, what is the practical application to it? You still get corners that aren't oriented correctly when using these algs...