Say I have M dimensions, and each dimension has N unique values, then:
There are N^M different combinations, if M is increased by 1, then the number of combinations increases exponentially!
An algorithm A tasked to check all those combinations will be inefficient!
It is possible to overcome this problem without a decrease in effectiveness?