A new algorithm for enumerating all possible Sudoku squares

DOI10.1142/S1793830916500269MaRDI QIDQ3178156zbMATH OpenFDO

Authors Pallavi Mishra, Rakesh P. Badoni, D. K. Gupta

Publication date 8 July 2016

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

Full work available at URL https://doi.org/10.1142/S1793830916500269

zbMATH Keywords

\(S\)-permutation matrices\(S\)-permutationsenumerationLatin squaresSudoku squares

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Number-theoretic algorithms; complexity (11Y16) Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05)

Recommendations

• On an algorithm for receiving sudoku matrices
• On the number of disjoint pairs of S-permutation matrices
• On the number of Sudoku squares
• Sudoku rectangle completion (extended abstract)
• Fractions of permutations. An application to Sudoku

Cites work

• Bounds on the number of small Latin subsquares
• scientific article; zbMATH DE number 5251073 (Why is no real title available?)
• On Completing Latin Squares
• On the number of 8 8 Latin squares
• On the probability of two randomly generated \(S\)-permutation matrices to be disjoint
• Permutation matrices related to Sudoku
• Sudoku, Gerechte Designs, Resolutions, Affine Space, Spreads, Reguli, and Hamming Codes
• The complexity of completing partial Latin squares
• The number of Latin squares of order 11
• There is no 16-clue sudoku: solving the sudoku minimum number of clues problem via hitting set enumeration

Cited in

(5)

• 2D Sudoku associated bijections for image scrambling
• A randomized algorithm for solving n-dimensional Sudoku puzzle with continuous difficulty level
• A pencil-and-paper algorithm for solving Sudoku puzzles
• On an algorithm for receiving sudoku matrices
• Unveiling order in chaos: a systematic approach based on graph theory in enumerating Sudoku grids of rank n

This page was built for publication: A new algorithm for enumerating all possible Sudoku squares

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