2000 character limit reached
On an algorithm for receiving Sudoku matrices (1604.02691v1)
Published 10 Apr 2016 in cs.DS and math.CO
Abstract: This work examines the problem to describe an efficient algorithm for obtaining $n2 \times n2$ Sudoku matrices. For this purpose, we define the concepts of $n\times n$ $\Pi_n$-matrix and disjoint $\Pi_n$-matrices. The article, using the set-theoretical approach, describes an algorithm for obtaining $n2$-tuples of $n\times n$ mutually disjoint $\Pi_n$ matrices. We show that in input $n2$ mutually disjoint $\Pi_n$ matrices, it is not difficult to receive a Sudoku matrix.