extend cayley tables to associative operations
Exhaustive search for Keane's problem

The innermost of two nested searches: allocate some uncolored points
on a cube to create a new region that is both connected and that
touches all the existing regions.
Keane problem solver first draft works

But it is too inefficient to solve the problem for N>3.
don't allow region adder to add empty regions