Difference between revisions of "Subset"

(Created page with "A '''subset''' is a group of algorithms, typically all of which have something in common of that specific subset, which can be used to solve all cases of a certain type. Exam...")
 
 
(One intermediate revision by the same user not shown)
Line 1: Line 1:
A '''subset''' is a group of algorithms, typically all of which have something in common of that specific subset, which can be used to solve all cases of a certain type.
+
A '''subset''' is a group of algorithms, typically all of which within that set have something in common, which can collectively be used to solve all cases of a certain type.
  
 
Examples of subsets include:
 
Examples of subsets include:
* [[PLL]] (preserves [[OLL]] and [[F2L]] but affects [[permutation]] of the last layer)
+
* [[PLL]] (preserves [[OLL]] and [[F2L]] but affects [[permutation]] of the [[last layer]])
 
* [[OLL]] (preserves [[F2L]] but affects [[orientation]] of the last layer)
 
* [[OLL]] (preserves [[F2L]] but affects [[orientation]] of the last layer)
 
* [[CMLL]] (preserves [[F2B]] but affects the top [[layer]]'s [[corner]]s)
 
* [[CMLL]] (preserves [[F2B]] but affects the top [[layer]]'s [[corner]]s)

Latest revision as of 23:23, 16 July 2017

A subset is a group of algorithms, typically all of which within that set have something in common, which can collectively be used to solve all cases of a certain type.

Examples of subsets include:

See Also