Latin square

A Latin square of size $n$ is an $n \times n$ table filled with $n$ copies of each of the integers between $1$ and $n$ in such a way that each row and column contains exactly one copy of each integer.

The problem of counting the number of Latin squares of size $n$ seems to be extremely difficult.


The Sudoku puzzle is an example of a latin square This article is a stub. Help us out by expanding it.