Come up with an algorithm or some sort of solution for insta

Come up with an algorithm or some sort of solution for instant insanity puzzle for n number of cubes and n number of colors.

Solution

This puzzle is that each cube has 3 different colors. And we have to line up these colors with no repeating colors in such a way so that with n cubes, we have n number of colors. So our problem is to find a path, passing from each cube ( node) without repeating same number path where path are numbered according to path numbers.

So we determine if it is possible to put n cubes together so that each color appears only one time on each side of thus formed pile of cubes, is NP(Node-Path) complete. Thus in this arrangement, no two faces on one side of cube must have the same color.

Thus n cube, n color puzzle can be solved by applying NP complete graphing approach.

Answer