I have such a problem: there are several boolean tupels (properties of some objects)
K1 = (0, 1, 0) K2 = (1, 1, 0) K3 = (1, 1, 0) K4 = (0, 0, 1) K5 = (0, 0, 1)
I need to get all possible combinations, such that boolean sum of elements == (1, 1, 1), e.g.
N = [(K1, K2, K4), (K1, K3, K4), (K1, K2, K5), (K1, K3, K5), (K2, K4), (K2, K5), (K3, K4), (K3, K5), ..., (K1, K2, K3, K4, K5)]
So the questions are:
- Can be this problem formalized as combinatorics problem?
- Are there any usefull functions in numpy, scipy (Python) to solve this problem?
I belive if I get formalization of this problem I'll be able to solve by programming.
Thank you very much for your attention!