I wrote a small program in C++ to arrange wall tiles so that it minimised patterns. I did not want a 'random' pattern as that would have allowed 2 red tiles next to each other. I did this by defining a set of patterns and weighting each set then iterating many times over a grid of tiles moving them, re-scoring the result and keeping the best. I imagine there is a more mathematical way to achieve this but I don't know what to search for.
Is there a field of mathematics concerned with no patterns?
0
$\begingroup$
random
sorting
-
0If we forget the application and just look at the requirements of taking a pile of coloured tiles and arranging them in an order that minimises the occurrence of pre-defined arrangements - is there a mathematical field in which this could be expressed? – 2012-11-01