On an algorithm for receiving Sudoku matrices
نویسنده
چکیده
This work examines the problem to describe an efficient algorithm for obtaining n × n Sudoku matrices. For this purpose, we define the concepts of n×n Πn-matrix and disjoint Πn-matrices. The article, using the set-theoretical approach, describes an algorithm for obtaining n-tuples of n× n mutually disjoint Πn matrices. We show that in input n 2 mutually disjoint Πn matrices, it is not difficult to receive a Sudoku matrix.
منابع مشابه
Random Permutations, Random Sudoku Matrices and Randomized Algorithms
Some randomized algorithms, used to obtain a random n2 × n2 Sudoku matrix, where n is a natural number, is reviewed in this study. Below is described the set Πn of all (2n) × n matrices, consisting of elements of the set Zn = {1, 2, . . . , n}, such that every row is a permutation. It is proved that such matrices would be particularly useful in developing efficient algorithms in generating Sudo...
متن کاملOn the Number of Disjoint Pairs of S-permutation Matrices
In [Journal of Statistical Planning and Inference (141) (2011) 3697– 3704], Roberto Fontana offers an algorithm for obtaining Sudoku matrices. Introduced by Geir Dahl concept disjoint pairs of S-permutation matrices [Linear Algebra and its Applications (430) (2009) 2457-2463] is used in this algorithm. Analyzing the works of G. Dahl and R. Fontana, the question of finding a general formula for ...
متن کاملOn Some Entertaining Applications of the Concept of Set in Computer Science Course
Some aspects of programming education are examined in this work. It is emphasised, based on the entertainment value, the most appropriate examples are chosen to demonstrate the different language constructions and data structures. Such an example is the demonstrated algorithm for solving the widespread nowadays “Sudoku” puzzle. This is made, because of the connection with the term set and putti...
متن کاملAlternating Sign Matrices and Polynomiography
To each permutation matrix we associate a complex permutation polynomial with roots at lattice points corresponding to the position of the ones. More generally, to an alternating sign matrix (ASM) we associate a complex alternating sign polynomial. On the one hand visualization of these polynomials through polynomiography, in a combinatorial fashion, provides for a rich source of algorithmic ar...
متن کاملComputing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method
A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Math., Alg. and Appl.
دوره 9 شماره
صفحات -
تاریخ انتشار 2017