#### Logiqx

##### Member

I've created a diagram which shows the hierarchy of last layer sub-steps with OLLCP and ZBLL at the top.

The diagram should be pretty self-explanatory. Please let me know if I've made any mistakes or major omissions.

Here's the link - http://cubing.mikeg.me.uk/LLSS.pdf

What I mean by a "pure" subset is where the exact cases can be found in the parent set; recognition and execution. The typical OCLL (orienting corners, retaining edge orientation) consists of 7 cases from OLL and is what I call a "pure" subset. If you arrange the 57 OLL cases in a grid with corner orientation on one axis and edge orientation on another axis the 7 OCLL cases are a straight copy of an entire row / column.

What I mean by a "loose" subset is where you pick one alg from a number of cases to achieve the desired effect. An example of this might be for the basic EOLL as the first step of a 4LLL. For 2 handed solving you might pick something like F (U R U' R') F' whereas for one handed solving you might pick something like r U2 R' U' R U' r'. These are both selected from the full set of OLL algorithms but they are for different OLL cases and aren't being used for the original purpose. Any OLL case which flips edges can be used for basic EOLL as the effect on corners is unimportant. Going back to the grid (corner orientation on one axis and edge orientation on another axis) this type of subset is not made up from entire rows / columns of the parent set.

Updates:

1.0.7 - 2016-12-18 - ZZLL actually has 169 algorithms

1.0.6 - 2016-01-03 - OLLCP is actually a "loose" subset of 1LLL

1.0.5 - 2015-12-29 - Minor cosmetics

1.0.4 - 2015-12-29 - Added OCELL

1.0.3 - 2015-06-18 - Mentioned Pi and H subsets for ZZ-Blah

1.0.2 - 2015-06-18 - Added number of unique 1LLL algorithms (3,915)

1.0.1 - 2015-06-18 - Cosmetic changes

1.0.0 - 2015-06-17 - Initial release

The diagram should be pretty self-explanatory. Please let me know if I've made any mistakes or major omissions.

Here's the link - http://cubing.mikeg.me.uk/LLSS.pdf

What I mean by a "pure" subset is where the exact cases can be found in the parent set; recognition and execution. The typical OCLL (orienting corners, retaining edge orientation) consists of 7 cases from OLL and is what I call a "pure" subset. If you arrange the 57 OLL cases in a grid with corner orientation on one axis and edge orientation on another axis the 7 OCLL cases are a straight copy of an entire row / column.

What I mean by a "loose" subset is where you pick one alg from a number of cases to achieve the desired effect. An example of this might be for the basic EOLL as the first step of a 4LLL. For 2 handed solving you might pick something like F (U R U' R') F' whereas for one handed solving you might pick something like r U2 R' U' R U' r'. These are both selected from the full set of OLL algorithms but they are for different OLL cases and aren't being used for the original purpose. Any OLL case which flips edges can be used for basic EOLL as the effect on corners is unimportant. Going back to the grid (corner orientation on one axis and edge orientation on another axis) this type of subset is not made up from entire rows / columns of the parent set.

Updates:

1.0.7 - 2016-12-18 - ZZLL actually has 169 algorithms

1.0.6 - 2016-01-03 - OLLCP is actually a "loose" subset of 1LLL

1.0.5 - 2015-12-29 - Minor cosmetics

1.0.4 - 2015-12-29 - Added OCELL

1.0.3 - 2015-06-18 - Mentioned Pi and H subsets for ZZ-Blah

1.0.2 - 2015-06-18 - Added number of unique 1LLL algorithms (3,915)

1.0.1 - 2015-06-18 - Cosmetic changes

1.0.0 - 2015-06-17 - Initial release

Last edited: Dec 18, 2016