Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things

Re^2: Faster alternative to Math::Combinatorics

by AppleFritter (Vicar)
on Sep 02, 2017 at 19:14 UTC ( #1198591=note: print w/replies, xml ) Need Help??

in reply to Re: Faster alternative to Math::Combinatorics
in thread Faster alternative to Math::Combinatorics

More answers and solutions are always good, so thanks a lot for your effort!

The reason you're getting 27 combinations is that you're producing ordered tuples, whereas what I'm looking for is multisets (which are by definition unordered). I'll quote what I wrote in my post:

I'm trying to generate all multisets (bags) of a specific total "weight" (let's call it w), where each element comes from a given list (of numbers, in this case), and each list element may have multiplicity 0..w in each multiset. In other words, what I'm trying to generate is a list of w-tuples of elements of the given list but unordered tuples rather than ordered ones.

What this means is that:

  • Results that contain the same numbers a different amount of times are distinguished: "2,3,3" is not the same as "2,2,3".
  • Results that are merely reordered are NOT distinguished: "2,3,3" is the same as "3,2,3" and "3,3,2".

Wikipedia has more on multisets: Multiset.

Like I said in my reply to tybalt89, the underlying problem I was trying to solve here¹ is related to a certain class of cellular automata with multiple states. I needed to generate all the possible combinations of states a certain subset of a given cell's immediate neighborhood could be in — but I was only interested in outer-totalistic CAs where the specific alignment of those neighboring cells didn't matter. Hence: it makes a difference whether of three cells I'm considering, one is in state 2 and two in state 3, or two in state 2 and one in state 3; but it doesn't make a difference specifically where in the center cell's neighborhood those neighboring cells are. Multisets / multicombinations were a natural choice for representing that.

TL;DR — thanks again, I appreciate all the good replies, tips, pointers and suggestions I got!


  1. And which I have solved; it turns out that Algorithm::Combinatorics not only has a convenient function (combinations_with_repetitions) to generate just what I need, that function is also blindingly fast. See my reply to BrowserUk who also misunderstood (or didn't read carefully, one imagines) my question.
  • Comment on Re^2: Faster alternative to Math::Combinatorics

Replies are listed 'Best First'.
Re^3: Faster alternative to Math::Combinatorics
by Laurent_R (Canon) on Sep 02, 2017 at 21:22 UTC
    OK, AppleFritter, thanks for your answer.

    Thinking more about it, what I get with this program is actually 27 permutations, not 27 combinations. But English is not my mother tongue (and, as far as I can say, probably also not yours), so I probably got a bit confused about it. And I did not know anything about multisets before (or had forgotten everything about it).

    Thanks a lot for the clarification.

    I haven't checked thoroughly, but it seems that the program I have suggested in my other post ( probably does what you want.

    Update: And, BTW, my code in the other post runs in less than 1/20th of a second, so it is also fairly fast.

Log In?

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://1198591]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others contemplating the Monastery: (1)
As of 2023-03-26 03:36 GMT
Find Nodes?
    Voting Booth?
    Which type of climate do you prefer to live in?

    Results (63 votes). Check out past polls.