I'm not sure if anything like this has ever been done before, but just had an idea for a puzzle on a 6x6x6 cube.
Can the cube be solved in such a way that on every face, each row and column contains exactly 1 sticker of each color? If so, what is the best algorithm to solve it into this...
Basically, the idea is to solve the middle layer first, then sort the remaining pieces into the top and bottom layers and solve each layer separately. However there are a few special "parity" cases where one piece in each layer is incorrectly placed or oriented. It may be possible to use full...