Let's suppose I want to generate n equal sized boolean arrays with maximum difference. - Difference in this case is defined as that the arrays share as low as possible fields with one another. (an example of share: array1 = {1,0,0,0) and array2 = {1,1,1,1} -> array1 and array2 share 1 field (array1[0] / array2[0])Just for example: n would equal 2 and the size of the field would be 6-> the optimum solution would be the arrays [0,0,0,0,0,0],[1,1,1,1,1,1] because they share no fields and so are very different from one anotherAnother example: n was equal to 4 and the size of the array would be 4-> a solution would be [0,0,0,0], [1,1,1,1], [1,1,0,0], [0,0,1,1] - the arrays share 1.33 fields per array by averageHas anybody an idea of an algorithm or solution strategy that could solve this problem (generate n of these arrays) perfectly (or very good - so that they are as different as possible) (in a realistic runtime)? Thanks very much in advance :D
Algorithm to create n arrays with maximum difference
algorithms;optimization;arrays