On an algorithm for receiving Sudoku matrices

Abstract

This work examines the problem to describe an efficient algorithm for obtaining $n^2\times n^2$ 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 $n^2$-tuples of $n\times n$ mutually disjoint ${\Pi }_n$ matrices. We show that in input $n^2$ mutually disjoint ${\Pi }_n$ matrices, it is not difficult to receive a Sudoku matrix.

References in corpus (1)

• Random Permutations, Random Sudoku Matrices and Randomized Algorithms