Need Help With Method Design - A method which iterates of all possible input combinations (like strategy tester optimizer)

I have designed a class which is going to act as a 'live optimizer'.

Currently there is a method which iterates over all the different input configurations using a start, step, end value - just like the optimizer.

However, I can't figure a good practice for preventing duplicates like here:

I've tried a few things but one implementation always breaks the nested loops some how.

Looking for someone to come up with a solution for me here.

• I've set up a testing script ready, which is what is shown above
• The method should accept a dynamic amount of inputs, and iterate all possibilities with duplicates removed.

Code is also attached - I am not sure how complex the solution would be.

I thought if in loop optimization is too hard, maybe some clean up code is needed - but I am sure there is a way to fix the loop counters mathematically.

Look forward to hearing from you.