Use this tag for programming questions about Latin squares. A Latin square is a N x N square array, populated with N distinct symbols. Each symbol occurs exactly once in each row, and it occurs exactly once in each column.
A Latin square is a N x N array filled with N distinct symbols. Each symbol appears exactly once in every row and exactly once in every column. This term was inspired by Leonhard Euler.
A reduced Latin square is one in which the symbols in the first row are in their natural order. The number of reduced Latin squares is thus fewer then the number of overall Latin squares, except for the trivial case N = 1.
The formula for computing the exact number of Latin squares for a size N is not easily computable.
Solutions to Sudoku puzzles are special cases of Latin squares.