We have 6 circles. Each circle splited into 8 slices. Each slice has its own color.
With the following condition: The color of touching slices must be identical
The output should be arrangment according to the root colors (it changes when I rotate the root).
Seems trivial if each slice has a unique color.
Look into graph coloring algorithms. You can represent the pyramid as a graph where each slice is a vertex and adjacent slices are connected by an edge. Your exact problem seems somewhat different from graph coloring, but it is quite similar.
Cheers, D Drmmr
Please put [code][/code] tags around your code to preserve indentation and make it more readable.
As long as man ascribes to himself what is merely a posibility, he will not work for the attainment of it. - P. D. Ouspensky
Reply With Quote
Originally Posted by liel2010
Bookmarks