Skip to main content
Conference Proceedings

Solving single-digit sudoku subproblems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7288 LNCS 142-153
DOI: 10.1007/978-3-642-30347-0_16
2Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We show that single-digit "Nishio" subproblems in n×n 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. © 2012 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Eppstein, D. (2012). Solving single-digit sudoku subproblems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7288 LNCS, pp. 142–153). https://doi.org/10.1007/978-3-642-30347-0_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free