New answers tagged algorithm
0
A possible approach would be starting by grouping the actions into all possible groups.
For 30 actions grouped in a maximum of 6 this would mean:
$$
C^{30}_6 + C^{30}_5 + C^{30}_4 + C^{30}_3 + C^{30}_2 + C^{30}_1 = 768 211
$$
Operations.
Then, I would define the constraints to simplify the problem, as in a Constraint Satisfaction Problem (CSP). The main ...
Top 50 recent answers are included
