Is there an object that already does this? Any approaches, suggestions etc. most welcome.
Ricky
-
Generating all possible permutations of a fixed number set
-
I have no suggestions but I've always wondered about this; in the Autechre track "Flutter" the drum pattern is apparently programmed to be entirely different every measure, never repeating. It would be really cool to set up something like that in PD with permutations.
-
Yes, albeit I'm approaching this from an atonal composition point of view. Basically, the same principle applies here. It is simple to work out on paper, but for convenience sake, it would be nice to have an object to output a matrix of a set, variable in size (i.e. variable amount of notes per set). It could of course, then, be applied to various other cues, such as rhythm etc. I'm thinking some combination of
and [coll] may be feasible. Of course there are many ways in which such an object could be built;
e.g. Say we have a number set 1 2 3 4; I might follow "An Ordered Lexicographic Permutation Algorithm based on one published in Practical Algorithms in C++":
http://www.bearcave.com/random_hacks/permute.htmlThus printing all possible permutations of sets of 4 (3, 2, 1) stored, for example, in a [coll];
1 2 3 4 2 1 3 4 3 1 2 4 4 1 2 3
1 2 4 3 2 1 4 3 3 1 4 2 4 1 3 2
1 3 2 4 2 3 1 4 3 2 1 4 4 2 1 3
1 3 4 2 2 3 4 1 3 2 4 1 4 2 3 1
1 4 2 3 2 4 1 3 3 4 1 2 4 3 1 2
1 4 3 2 2 4 3 1 3 4 2 1 4 3 2 1 -
Does anyone have any suggestions?
Cheers,
Ricky
-
It's definitely not perfect, but I just made this. It only works for a list containing four elements. It uses a subpatch that permutes a list of three elements (much easier to do).
-
Couldn't resist a bit of thread necromancy!
Here's a way of generating randomised permutations of any input list
