ABSTRACT
The use of color can make computer displays and interfaces more readable. Ideally, the colors in a display will be maximally different from one another. A genetic algorithm can be used to pick large sets of colors such that all pairs in the set are, according to one metric, nearly maximally distinguishable. After some trial and error, a fitness function was derived that consisted of the CIE distance between two closest pair of colors in the set plus a small constant times the sum of CIE distances between all pairs of colors in the set. This makes the first priority that no two colors in the set are very much alike; as a secondary priority, it also tries to maximize other separations between color pairs given that the worst pair has been dealt with. The palettes are described in terms of the R3 colors that most closely match the RGBs produced by the output.
