A pencil-and-paper algorithm for solving Sudoku puzzles

MaRDI QIDQ3627476zbMATH OpenFDO

Authors J. F. Crook

Publication date 12 May 2009

Full work available at URL http://www.ams.org/notices/200904/rtx090400460p.pdf

zbMATH Keywords

proper coloring of a graphSudoku puzzle

Mathematics Subject Classification ID

Recreational mathematics (00A08) Methodology of mathematics (00A35) Orthogonal arrays, Latin squares, Room squares (05B15) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Solving Sudoku puzzles with rewriting rules
• Sudoku: strategy versus structure
• A randomized algorithm for solving n-dimensional Sudoku puzzle with continuous difficulty level
• scientific article; zbMATH DE number 5722803
• A new algorithm for enumerating all possible Sudoku squares

Cited in

(3)

• A randomized algorithm for solving n-dimensional Sudoku puzzle with continuous difficulty level
• Solving Sudoku puzzles with rewriting rules
• A restarted estimation of distribution algorithm for solving sudoku puzzles

This page was built for publication: A pencil-and-paper algorithm for solving Sudoku puzzles

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