On an algorithm for receiving sudoku matrices

DOI10.1142/S1793830917500380MaRDI QIDQ5367532zbMATH OpenOpenAlexFDO

Authors Krasimir Yordzhev

Publication date 20 October 2017

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1604.02691

zbMATH Keywords

disjoint matricesS-permutation matrixSudoku matrix\(\Pi_n\)-matrixdata type set

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Abstract data types; algebraic specification (68Q65)

Abstract: This work examines the problem to describe an efficient algorithm for obtaining $n^{2}imes{n}^2$ Sudoku matrices. For this purpose, we define the concepts of $nimesn$ $P{i}_n$-matrix and disjoint $P{i}_n$-matrices. The article, using the set-theoretical approach, describes an algorithm for obtaining $n^2$-tuples of $nimesn$ mutually disjoint $P{i}_n$ matrices. We show that in input $n^2$ mutually disjoint $P{i}_n$ matrices, it is not difficult to receive a Sudoku matrix.

Recommendations

• A new algorithm for enumerating all possible Sudoku squares
• On the number of disjoint pairs of S-permutation matrices
• A randomized algorithm for solving \(n\)-dimensional Sudoku puzzle with continuous difficulty level
• On the number of mutually disjoint pairs of \(S\)-permutation matrices
• A study of the Sudoku graph family

Cites work

• scientific article; zbMATH DE number 3951978 (Why is no real title available?)
• scientific article; zbMATH DE number 1433423 (Why is no real title available?)
• A new algorithm for enumerating all possible Sudoku squares
• Calculation of the number of all pairs of disjoint S-permutation matrices
• Permutation matrices related to Sudoku

Cited in

(6)

• Solving Survo puzzles using matrix combinatorial products
• The Shannon entropy of Sudoku matrices
• On the number of disjoint pairs of S-permutation matrices
• 2D Sudoku associated bijections for image scrambling
• A randomized algorithm for solving \(n\)-dimensional Sudoku puzzle with continuous difficulty level
• A new algorithm for enumerating all possible Sudoku squares

This page was built for publication: On an algorithm for receiving sudoku matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5367532)