Can anyone suggest a method to generate 'recursively' a Latin square of size n.

Eg of Laint square of size n=3

123
231
312

Please advise.

Brute force is the easy way - but I am sure there is a more elegant way.

It seems that you can just check your previous "rows" and "columns" until you find a number that would fit.

__________________
The best damn Sports Blog period.

You can go here for every possible Magic Square (Latin Square is a type of magic square) formula you'll ever need. Once you get a formula, you should be able to make a recursive function out of it easily.

__________________
"To argue with a person who has renounced the use of reason is like administering medicine to the dead."
-Thomas Paine
www.sullivan-county.com/deism.htm

hey. does anyone have a python program for latin squares? I've been trying to make one myself, but I'm making little progress and I'd like an example to see why it's not working. Can anyone help me out?