I've been looking at normal Sudoku Squares (SS) and how many are orthogonal (ie: allow creation of orthogonal pairs).
Based on large samplings of random SS it appears that only 1 in 20,000 (roughly) are orthogonal. Compare this with 9x9 Latin squares (LS) for which roughly 1 in 100 have orthogonal mates.
Orthogonality depends on the existence of transversals. A transversal in a 9x9 Latin Square is a set of 9 cells (R, C, N) that covers all 9 rows, columns, and number values. For standard Sudoku Squares a transversal is a set of 9 cells (R, C, B, N) that covers all 9 rows, columns, 3x3 blocks, and number values.
Here is an example of a Sudoku transversal (cells marked *):
- Code: Select all
9 2* 1 | 3 6 5 | 8 4 7
3 7 8 | 1* 9 4 | 5 2 6
6 4 5 | 7 2 8 | 1 9 3*
------------------------------
8 6 4 | 9 3 2 | 7* 5 1
5 3 9* | 4 7 1 | 2 6 8
2 1 7 | 5 8 6* | 4 3 9
------------------------------
4* 8 6 | 2 1 9 | 3 7 5
1 5 3 | 6 4 7 | 9 8* 2
7 9 2 | 8 5* 3 | 6 1 4
Fundamental Theorem of Orthogonality
- A Latin Square of order n has an orthogonal mate iff it has a set of n disjoint transversals, that is, a set of n transversals that covers all n^2.
- The same is true for Sudoku Squares.
Orthogonality testing thus requires a simple recursive function that enumerates all transversals, and another simple recursion to find subsets of 9 disjoint transversals.
9x9 Latin Squares have on average 214 transversals (minimum = 68, maximum = 2241). This is a known result.
9x9 Sudoku Squares have on average just 21 transversals (minimum = 1, maximum = 159). This is based on my samplings of 500 million SS's. (This largely explains the relative scarcity of orthogonal Sudokus).
I will provide examples of Sudoku Squares with minimal and maximal NTV (number of transversals) below.
[Edit: I have found a Sudoku with NO transversals, see below]