Skip to main content
SpringerLink
Log in

Solving Single-Digit Sudoku Subproblems

  • Conference paper
Fun with Algorithms (FUN 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7288))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arnold, E., Lucas, S., Taalman, L.: Gröbner basis representations of Sudoku. College Math. J. 41(2), 101–111 (2010)

    Article  MathSciNet  Google Scholar 

  2. Babu, P., Pelckmans, K., Stoica, P., Li, J.: Linear systems, sparse solutions, and Sudoku. IEEE Signal Processing Lett. 17(1), 40–42 (2010)

    Article  Google Scholar 

  3. Bellman, R.: Dynamic programming treatment of the travelling salesman problem. J. ACM 9, 61–63 (1962)

    Article  MATH  Google Scholar 

  4. Björklund, A.: Exact covers via determinants. In: 27th Int. Symp. Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics, vol. 5, pp. 727–737. Schloss Dagstuhl (2010)

    Google Scholar 

  5. Björklund, A., Husfeldt, T.: Exact algorithms for exact satisfiability and number of perfect matchings. Algorithmica 52(2), 226–249 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  6. Brouwer, A.E.: Sudoku puzzles and how to solve them. Nieuw Archief Wisk (Ser. 5) 7, 258–263 (2006), http://www.win.tue.nl/~aeb/preprints/sudoku.pdf

  7. Dahl, G.: Permutation matrices related to Sudoku. Linear Algebra Appl. 430(8-9), 2457–2463 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  8. Eppstein, D.: Searching for spaceships. In: Nowakowski, R.J. (ed.) More Games of No Chance, MSRI Publications, vol. 42, pp. 433–453. Cambridge Univ. Press (2002), http://www.msri.org/publications/books/Book42/files/eppstein.pdf

  9. Eppstein, D.: Nonrepetitive paths and cycles in graphs with application to Sudoku (2005)

    Google Scholar 

  10. Eppstein, D.: Recognizing partial cubes in quadratic time. J. Graph. Algorithms Appl. 15(2), 269–293 (2011), http://jgaa.info/accepted/2011/Eppstein2011.15.2.pdf

    MathSciNet  Google Scholar 

  11. Geem, Z.W.: Harmony Search Algorithm for Solving Sudoku. In: Apolloni, B., Howlett, R.J., Jain, L. (eds.) KES 2007, Part I. LNCS (LNAI), vol. 4692, pp. 371–378. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  12. Gordon, P., Longo, F.: MENSA Guide to Solving Sudoku. Sterling (2006)

    Google Scholar 

  13. Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. J. SIAM 10(1), 196–210 (1962)

    MathSciNet  MATH  Google Scholar 

  14. Herzberg, A.M., Murty, M.R.: Sudoku squares and chromatic polynomials. Notices Amer. Math. Soc. 54(6), 708–717 (2007), http://www.ams.org/notices/200706/tx070600708p.pdf

    MathSciNet  MATH  Google Scholar 

  15. Hunt, M., Pong, C., Tucker, G.: Difficulty-driven Sudoku puzzle generation. UMAP J 29(3), 343–362 (2008)

    Google Scholar 

  16. Koch, T.: Rapid mathematical programming or how to solve Sudoku puzzles in a few seconds. In: Conf. German Oper. Res. Soc. Oper. Res. Proc., vol. 2005, pp. 21–26. Springer (2006)

    Google Scholar 

  17. Lawler, E.L.: A note on the complexity of the chromatic number problem. Inf. Proc. Lett. 5(3), 66–67 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  18. Lewis, R.: Metaheuristics can solve sudoku puzzles. J. Heuristics 13(4), 387–401 (2007)

    Article  Google Scholar 

  19. Lynce, I., Ouaknine, J.: Sudoku as a SAT problem. In: 9th Int. Symp. Artificial Intelligence and Math. (2006), http://sat.inesc.pt/~ines/publications/aimath06.pdf

  20. Madsen, B.A.: An algorithm for exact satisfiability analysed with the number of clauses as parameter. Inf. Proc. Lett. 97(1), 28–30 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  21. Mantere, T., Koljonen, J.: Solving, rating and generating Sudoku puzzles with GA. In: IEEE Cong. Evolutionary Computation. pp. 1382–1389 (2007)

    Google Scholar 

  22. Moon, T.K., Gunther, J.H.: Multiple constraint satisfaction by belief propagation: an example using Sudoku. In: IEEE Mountain Worksh. Adaptive and Learning Systems, pp. 122–126 (2006)

    Google Scholar 

  23. Moon, T.K., Gunther, J.H., Kupin, J.J.: Sinkhorn solves Sudoku. IEEE Trans. Inf. Theory 55(4), 1741–1746 (2009)

    Article  MathSciNet  Google Scholar 

  24. Moraglio, A., Togelius, J.: Geometric particle swarm optimization for the Sudoku puzzle. In: 9th Conf. Genet. Evol. Comput. pp. 118–125 (2007)

    Google Scholar 

  25. Ostrowski, R., Paris, L.: From XSAT to SAT by exhibiting equivalencies. In: 20th IEEE Conf. Tools with Artificial Intelligence, pp. 84–91 (2008)

    Google Scholar 

  26. Rosenhouse, J., Taalman, L.: Section 7.3: Sudoku as a problem in graph coloring. In: Taking Sudoku Seriously, pp. 127–131. Oxford University Press (2011)

    Google Scholar 

  27. Simonis, H.: Sudoku as a constraint problem. In: Hnich, B., Prosser, P., Smith, B. (eds.) Proc. 4th Int. Works. Modelling and Reformulating Constraint Satisfaction Problems, pp. 13–27 (2005), http://4c.ucc.ie/~brahim/mod-proc.pdf

  28. Stephens, P.: Mastering Sudoku Week By Week. Sterling (2007)

    Google Scholar 

  29. Sudopedia: Pattern Overlay Method, http://sudopedia.org/wiki/Pattern_Overlay_Method

  30. Weber, T.: A SAT-based Sudoku solver. In: Proc. 12th Int. Conf. on Logic for Programming, Artificial Intelligence, and Reasoning, Short Papers, pp. 11–15 (2005)

    Google Scholar 

  31. Yato, T., Seta, T.: Complexity and completeness of finding another solution and its application to puzzles. IEICE Trans. Fundamentals E86-A(5), 1052–1060 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of California, Irvine, USA

    David Eppstein

Authors
  1. David Eppstein
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Carleton University, 1125 Col. By Dr., K1S 5B6, Ottawa, ON, Canada

    Evangelos Kranakis

  2. Department of Mathematics and Computer Science, Wesleyan University, 06459, Middleton, CT, USA

    Danny Krizanc

  3. Dipartimento di Scienze Ambientali, Informatica e Statistica, Università Ca’ Foscari, Via Torino 155, 30172, Mestre (Ve), Italy

    Flaminia Luccio

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Eppstein, D. (2012). Solving Single-Digit Sudoku Subproblems. In: Kranakis, E., Krizanc, D., Luccio, F. (eds) Fun with Algorithms. FUN 2012. Lecture Notes in Computer Science, vol 7288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30347-0_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30347-0_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30346-3

  • Online ISBN: 978-3-642-30347-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation