How *not* to solve a sudoku

DOI10.1016/J.ORL.2010.09.001MaRDI QIDQ614048zbMATH OpenOpenAlexFDO

Authors Adriana F. Gabor, Gerhard J. Woeginger

Publication date 23 December 2010

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2010.09.001

zbMATH Keywords

assignment problemcomputational complexitymatching problem

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial games (91A46)

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Sudoku puzzles and how to solve them
• Sudoku: strategy versus structure

Cited in

(3)

• Set selection dynamical system neural networks with partial memories, with applications to Sudoku and KenKen puzzles
• Combining Hopfield neural networks, with applications to grid-based mathematics puzzles
• Sudoku associative memory

This page was built for publication: How \(*\)not\(*\) to solve a sudoku

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