Sudoku, KenKen, and Skyscrapers are three examples of Latin square puzzles. In all three, players are challenged to complete a Latin Square, a NxN grid (typically 9x9) in which the numbers 1-N appear in each row and each column exactly once. Different Latin square puzzles are distinguished by the extra restrictions placed on the placement of numbers. For instance, in Sudoku, the grid is subdivided into 9 3x3 grids, each of which must contain all numbers 1-9. Presumably, many (infinite?) Latin square puzzles may be constructed by coming up with different extra restrictions on the placement of the numbers.
A closely related type of array is a Graeco-Latin square. You can think of it as two Latin squares overlaid on each other, such that no two squares in the resulting grid contain the same two numbers. For example, the following is a 3x3 Graeco-Latin square.
$$ \begin{matrix} 1,4 && 2,6 && 3,5 \\ 2,5 && 3,4 && 1,6 \\ 3,6 && 1,5 && 2,4 \end{matrix} $$
Do there exist Graeco-Latin square puzzles? That is, are there puzzles whose goal is to construct a Graeco-Latin square, under some external constraint?