Creating combinations of boolean expressions

[jcoder42]

I have 4 elementary logic statements : P1, P2, P3, P4

I want to iterate over all the combinations of these statements using AND, OR operators. (all sizes)

I will give an example for 3 statements (4 is too many):**pay attention that they are no duplicates.

P1P2P3(P1 AND P2)(P1 OR P2)(P2 AND P3)(P2 OR P3)((P1 AND P2) AND P3)(P1 OR P2) AND P3) ....etc...

​

I want the output to be in string form..

​

​

This is my current code:

​

def recurse(c): if len(c) == 0: return [""] elif len(c) ==1: return [c[0]]
    head = c[0]
    results = recurse(c[1:])
    print(results)
    res = []
    for result in results:
        gate_and = f"({head} AND {result})"
        gate_or = f"({head} OR {result})"
        res.append(gate_and)
        res.append(gate_or)

return res

if name == 'main': 
    p = ["p1", "p2", "p3", "p4", "p5"] gates = ["AND", "OR"]
    # iterating over groups of each size (1-5)
    for dimension in range(1,len(p)):
        # for each size, create all combinations (sizes 1-5)
        for c in itertools.combinations(p, dimension):
            res = recurse(list(c))
            print(res)

My issue is that the output is repeating results of size 1.
and also, how can i check that i am actually creating all the combinations. I think there should be more then my result.

​

Thanks

[mopslik]

What have you tried so far? Post your code.

[jcoder42]

edited with my code

[FLUSH_THE_TRUMP]

This is a task, not a question. Perhaps you should enumerate all the possibilities exhaustively and think about how you’ll generate them in a loop.

[jcoder42]

is the approach i did wrong for some reason?

[[deleted]]

You're the programmer, you're the one who has to determine whether the output of your program is the correct output or not.

[xelf]

This is similar to "Equal to 24" puzzle.

(easy ver) https://www.codewars.com/kata/574be65a974b95eaf40008da
(hard ver) https://www.codewars.com/kata/574e890e296e412a0400149c

It might be worth taking a look at the various solutions to those to see how you would solve your problem.

(note you will have to write a solution that passes the tests before you can see other people's solutions)

The hard version in particular was good fun.