Three-Colour Numbers

In this example, a graph is constructed that resembles the input number. Sentient then tries to find a solution to the three-colour problem such that each colour is given a unique number and the total of all numbers in the graph adds up to the original number.

Choose a number (1 - 999): (or use the left and right arrow keys)

The numbers attributed to the colours must be unique, non-negative integers. Note that the number 2 has no solutions because it is impossible to construct a graph resembling the number 2 that adheres to these constraints.