Force-directed graph of BrickColors

There are 128 brickcolors. They are all connected to their five closest brickcolors and all other brickcolors that they are one of the five closest to. Connected colors are attracted. They like to stay a certain distance from each other. Non-connected colors repel each other, like a spring. They spread out and form a graph. This graph is directed by force.

Much-needed screenshot:

Er

I get 9 FPS in play solo and dragging the frames doesn’t result in anything. Is that supposed to happen?

Run it as a test from studio. Play solo doesn’t do anything because it’s changing the StarterGui.

Here’s a gif.

I… I want this as the new palette to choose colors from.

It doesn’t quite work as a palette, it’s just something cool to look at. What I really want to find is the global minimum of the sum of the differences of adjacent colors in a grid palette. Starting with a randomized palette and making random changes, keeping any change that reduces the total difference sum will calculate a local min, but it isn’t optimal, and potentially is very far from optimal.

edit: local min