User:Contribution/17-EDO resources: Difference between revisions

Contribution (talk | contribs)
Contribution (talk | contribs)
Line 130: Line 130:
* Starting from degree 0, the algorithm successively extends the set by applying one of the 17 possible intervals above every degree that has already been generated.
* Starting from degree 0, the algorithm successively extends the set by applying one of the 17 possible intervals above every degree that has already been generated.
* Each interval carries a weight (its Height): more “simple” intervals get larger weights than more remote ones.
* Each interval carries a weight (its Height): more “simple” intervals get larger weights than more remote ones.
* All unordered pitch-class sets obtained this way, modulo the 17-step equave, are grouped into chord classes (up to transposition).
* All pitch-class sets obtained this way, modulo the 17-step equave, are grouped into chord classes (up to inversion and transposition).
* Each chord class receives a score, computed from the weights of all the chains of intervals that generate it.
* Each chord class receives a score, computed from the weights of all the chains of intervals that generate it.
* The classes are then sorted from highest to lowest score; only the best-scoring ones for each cardinality are shown in the tables.
* The classes are then sorted from highest to lowest score; only the best-scoring ones for each cardinality are shown in the tables.