Re^2: Combinatorics problem.

You may want to try Algorithm::Combinatorics

I use Algorithm::Combinatorics all the time, but you have to work out which generator, or combination of generators to use for each particular problem, and this one is eluding me.

Also, I suspect that the sequence I need is a subset of one of the classical sequences (combs/perms/variations/partitions), and I would then need to filter the generated sequence, which can be grossly inefficient; so it may be better to program an algorithm that generates the sequence directly?

With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'

Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.

"Science is about questioning the status quo. Questioning authority". I knew I was on the right track :)

In the absence of evidence, opinion is indistinguishable from prejudice.

Comment on Re^2: Combinatorics problem.

Replies are listed 'Best First'.
Re^3: Combinatorics problem. by hdb (Monsignor) on Dec 11, 2015 at 09:34 UTC
You are looking for Composition_(combinatorics) and need to filter on the number of parts (after taking away 1 postcard for each pidgeon hole as suggested below). I have not found any code on CPAN for this. The bad news is that there are exponentially many compositions for a given number of postcards.	[reply]