Thanks for pointing this out.
Currently my code runs through the possible combinations for the numbers of dancers from Cubiconia, Quadradonia and Nlogonia, trying to skip combinations not suitable. Basically this is a nested loop through 2 variables for any given number of dances.
Is this a promising approach which only needs further optimization? Or is on the contrary a formula-based or recursive approach possible?
Thanks for any hints
Daft