You have 64 chess queens which come in 8 colors, with 8 queens per color. The goal is fill a chessboard with these queens so that any two queens of the same color cannot attack each other, even when allowed to move through differently colored queens. This means no two similarly colored queens may share a rank, file or diagonal.
In other words, can you fill a chessboard with 8 disjoint solutions to the classic Eight Queens puzzle?
What about with $n^2$ queens on an $n\times n$ board?