Sounds like you're basically building a euclidian rhythm generator?

I guess so. And I've looked into the euclidean algorithm. But that distributes beats equally across a given bar length. What I want to find out about is being able to quantize these distributions using a selected variety of divisions and then to iterate through all possible variations to be probably stored in a dict or a coll.

I'm just wondering what sort of approach I should take to this. and if anyone has made anything similar before.

I think this thread may have what you want--

https://cycling74.com/forums/math-problem-giving-me-a-headache-please-advise

Aha, thanks Terry. That seems to have done it! It is a case for a looping algorithm then I see. I wonder if this would be more efficient in js as opposed to max? What do you think?

Thanks again.

yes is definitely lends itself to a recursive treatment in a text-based language like javascript, but I've no experience with that-- I assume it would be faster (certainly would be in C, and I presumably Java too).

It's a pretty simple algorithm, and if you're doing it to generate rhythms, I can't really see the advantage using js (aside from compactness), even in real-time applications. for a more informed opinion someone with js experience would be better qualified to comment

This should get you started, it's a brute force approach which will put all the permutations into a coll. You could use filtering on the output of the uzi's to get rid of lengths you are not interested in.

Thanks guys. Both are fantastic approaches. I'll do some modifications and shall report back with the patch I'm using this method in.

Man, those are both just brilliant! My head is spinning...