Take all the integers below 100 that don’t contain a digit 9. There are 81 of them.
Is it possible to arrange these 81 numbers in a 9×9 grid in such a way that both the one’s places and the ten’s places form two separate Sukodu squares (using the digits 0–8 instead of 1–9)?
(I’m currently running a brute-force algorithm to discover a solution, but I have reason to believe that it’ll take longer than the universe, therefore any clever input is appreciated.)
You're looking at order-9 Mutually Orthogonal Latin Squares (MOLS).
Try looking at the data at Data on MOLS.
Also try a search on "orthogonal sudoku".
Here's a puzzle version by Paul Vaderlind.
And the solution: