On an algorithm for receiving sudoku matrices

DOI10.1142/S1793830917500380zbMATH Open1373.05034arXiv1604.02691OpenAlexW2963692793MaRDI QIDQ5367532FDOQ5367532

Authors: Krasimir Yordzhev 

Publication date: 20 October 2017

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

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.

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

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

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)

Cites Work

• Title not available (Why is that?)
• Permutation matrices related to Sudoku
• Calculation of the number of all pairs of disjoint S-permutation matrices
• Title not available (Why is that?)
• A new algorithm for enumerating all possible Sudoku squares

Cited In (1)

• The Shannon entropy of Sudoku matrices

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)