Solving single-digit sudoku subproblems

Authors:
David Eppstein
Affiliations:
Computer Science Department, University of California, Irvine
Venue:
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Year:
2012

Citing 8
Cited 0

Dynamic Programming Treatment of the Travelling Salesman Problem

Journal of the ACM (JACM)
Geometric particle swarm optimization for the sudoku puzzle

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Metaheuristics can solve sudoku puzzles

Journal of Heuristics
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings

Algorithmica - Parameterized and Exact Algorithms
From XSAT to SAT by Exhibiting Equivalencies

ICTAI '08 Proceedings of the 2008 20th IEEE International Conference on Tools with Artificial Intelligence - Volume 01
Sinkhorn solves Sudoku

IEEE Transactions on Information Theory
An algorithm for Exact Satisfiability analysed with the number of clauses as parameter

Information Processing Letters
Harmony search algorithm for solving Sudoku

KES'07/WIRN'07 Proceedings of the 11th international conference, KES 2007 and XVII Italian workshop on neural networks conference on Knowledge-based intelligent information and engineering systems: Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

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