A new algorithm for enumerating all possible Sudoku squares

DOI10.1142/S1793830916500269zbMath1339.05021MaRDI QIDQ3178156

Rakesh P. Badoni, Pallavi Mishra, Dharmendra Kumar Gupta

Publication date: 8 July 2016

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

zbMATH Keywords

Latin squaresenumerationSudoku squares\(S\)-permutation matrices\(S\)-permutations

Mathematics Subject Classification ID

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

Related Items

On an algorithm for receiving Sudoku matrices

Cites Work

• Unnamed Item
• The complexity of completing partial Latin squares
• On the number of 8\(\times 8\) Latin squares
• Permutation matrices related to Sudoku
• Bounds on the number of small Latin subsquares
• On the probability of two randomly generated \(S\)-permutation matrices to be disjoint
• There Is No 16-Clue Sudoku: Solving the Sudoku Minimum Number of Clues Problem via Hitting Set Enumeration
• The number of Latin squares of order 11
• Sudoku, Gerechte Designs, Resolutions, Affine Space, Spreads, Reguli, and Hamming Codes
• On Completing Latin Squares