Solving Single-digit Sudoku Subproblems

Details Solving Single-digit Sudoku Subproblems Solving Single-digit Sudoku Subproblems

2012-02-23

arxiv.org/abs/1202.5074v2

Computer Science

Data Structures and Algorithms

12 pages, 5 figures. To appear at the 6th International Conference on Fun with Algorithms (FUN 2012). This revision simplifies

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Solving Single-digit Sudoku Subproblems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Solving Single-digit Sudoku Subproblems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solving Single-digit Sudoku Subproblems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-658114