Question

Having spent a considerable amount of time now trying to come up with a way to (what I think) should be a relatively simple procedure, I have managed to write the code which will generate the results (thanks to suggestions on this wonderful forum!), but according to my calculations it would take several years to compute all possibilities, so I’m desperately looking for some help as I fear my computer may not live to see that day. 🙂 Any input would be very much appreciated!

What I would like to achieve is from a list of 10 unique entries (e.g. [‘A’,’B’,’C’,’D’,’E’,’F’,’G’,H’,’I’,’J’]), get all permutations over a string length of 10, but with the requirement that 1 of the elements (e.g. ‘C’), should occur exactly 3 times, and in all possible locations.

Right now I am using:

options = ['A','B','C','D','E','F','G','H','I','J']
def combos(options,n):
    if (n <= 0): return
    for s in options:
        if len(s) <= n: yield s
        for t in combos(options,n-len(s)): yield s+t

for x in combos(options,10):
    if x.count("C") == 3 and len(x) == 10:
        print x

This way, it is computing all possible permutations and picks the ones with 3 ‘Cs’, and therefore generates a large amount of unnecessary permutations which do not contain 3 ‘Cs’, hence why it is taking longer than necessary. Does anyone have any suggestions how I might get Python to adhere to the 3x ‘C’ restriction while generating the permutations?

many, many thanks in advance!

Answer 1

What BrenBarn proposes can give this:

from itertools import product, combinations

otheroptions = ['A','B',   'D','E','F','G','H','I','J']
c = "C"
l = 10
nc = 3

for t in product(otheroptions, repeat=l-nc):
    for p in combinations(range(l), nc):
        r = list(t)
        for i in p:
            r[i:i] = [c]
        print "".join(r)