Branches are a problem, depending on the number of parameters needed to be evaluated: > Solving a constraint satisfaction problem on a finite domain is an NP-c

Branches are a problem, depending on the number of parameters needed to be evaluated: > Solving a constraint satisfaction problem on a finite domain is an NP-complete problem in general. https://en.wikipedia.org/wiki/Complexity_of_constraint_satisfaction https://en.wikipedia.org/wiki/Complexity_of_constraint_satis...