All Title Author
Keywords Abstract

Solving Single-digit Sudoku Subproblems

Full-Text   Cite this paper   Add to My Lib


We show that single-digit "Nishio" subproblems in nxn Sudoku puzzles may be solved in time o(2^n), faster than previous solutions such as the pattern overlay method. We also show that single-digit deduction in Sudoku is NP-hard.


comments powered by Disqus

Contact Us


微信:OALib Journal