Sudoku rectangle completion (extended abstract)

DOI10.1016/J.ENDM.2015.06.101zbMATH Open1346.05025arXiv1704.08136OpenAlexW2214234028MaRDI QIDQ322367FDOQ322367

E. S. Mahmoodian, Mohammad Mahdian

Publication date: 14 October 2016

Abstract: Over the last decade, Sudoku, a combinatorial number-placement puzzle, has become a favorite pastimes of many all around the world. In this puzzle, the task is to complete a partially filled $9imes9$ square with numbers 1 through 9, subject to the constraint that each number must appear once in each row, each column, and each of the nine $3imes3$ blocks. Sudoku squares can be considered a subclass of the well-studied class of Latin squares. In this paper, we study natural extensions of a classical result on Latin square completion to Sudoku squares. Furthermore, we use the procedure developed in the proof to obtain asymptotic bounds on the number of Sudoku squares of order $n$.

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

zbMATH Keywords

Latin squarescritical sets in Latin squaresnumber of Sudoku squaresSudoku squares

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A course in combinatorics.
• Sudoku, Gerechte Designs, Resolutions, Affine Space, Spreads, Reguli, and Hamming Codes
• An existence theorem for latin squares
• There Is No 16-Clue Sudoku: Solving the Sudoku Minimum Number of Clues Problem via Hitting Set Enumeration
• Critical sets for Sudoku and general graph colorings

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Sudoku rectangle completion (extended abstract)

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