Advertisement

On the Combination of Constraint Programming and Stochastic Search: The Sudoku Case

  • Rhydian Lewis
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4771)

Abstract

Sudoku is a notorious logic-based puzzle that is popular with puzzle enthusiasts the world over. From a computational perspective, Sudoku is also a problem that belongs to the set of NP-complete problems, implying that we cannot hope to find a polynomially bounded algorithm for solving the problem in general. Considering this feature, in this paper we demonstrate how a metaheuristic-based method for solving Sudoku puzzles (which was reported by the same author in an earlier paper), can actually be significantly improved if it is coupled with Constraint Programming techniques. Our results, which have been gained through a large amount of empirical work, suggest that this combination of techniques results in a hybrid algorithm that is significantly more powerful than either of its constituent parts.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    van Hoeve, W.J.: The alldifferent constraint: A survey. CoRR cs.PL/0105015 (2001)Google Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    Yato, T., Seta, T.: Complexity and completeness of finding another solution and its application to puzzles. IEICE Trans. Fundamentals EA6-A(5), 1052–1060 (2003)Google Scholar
  4. 4.
    Lewis, R.: In press: Metaheuristics can solve sudoku puzzles. Journal of heuristics 13 (2007)Google Scholar
  5. 5.
    Smith, B.: Phase transitions and the mushy region in constraint satisfaction problems. In: Cohn, A. (ed.) 11th European Conference on Artificial Intelligence, pp. 100–104. John Wiley and Sons ltd., Chichester (1994)Google Scholar
  6. 6.
    Turner, J.S.: Almost all k-colorable graphs are easy to color. Journal of Algorithms 9, 63–82 (1988)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Felgenhauer, B., Jarvis, F.: Mathematics of sudoku. Online Resource: (2006), http://www.afjarvis.staff.shef.ac.uk/sudoku/
  8. 8.
    Cheeseman, P., Kanefsky, B., Taylor, W.M.: Where the really hard problems are. In: IJCAI-1991. Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, Sidney, Australia, pp. 331–337 (1991)Google Scholar
  9. 9.
    van Laarhoven, P., Aarts, E.: Simulated Annealing: Theory and Applications. D. Reidel Publishing Company, Dordrecht (1987)zbMATHGoogle Scholar
  10. 10.
    Mepham, M.: Sudoku archive. Online (2006), http://www.sudoku.org.uk/backpuzzles.htm
  11. 11.
    Royle, G.: Minimum sudoku. Online (2006), http://www.csse.uwa.edu.au/~gordon/sudokumin.php
  12. 12.
    Hanssen, V.: Sudoku puzzles. Online (2006), http://www.menneske.no/sudoku/eng/
  13. 13.
    Armstrong, S.: Sudoku solving techniques. Online (2006), http://www.sadmansoftware.com/sudoku/techniques.htm
  14. 14.
    Jensen, T.R., Toft, B.: Graph Coloring Problems, 1st edn. Wiley-Interscience, Chichester (1994)Google Scholar
  15. 15.
    Burke, E.K., De Causmaecker, P. (eds.): PATAT 2002. LNCS, vol. 2740. Springer, Heidelberg (2003)Google Scholar
  16. 16.
    Duong, T.A., Lam, K.H.: Combining constraint programming and simulated annealing on university exam timetabling. In: RIVF2004. Proceedings of the 2nd International Conference in Computer Sciences, Research, Innovation & Vision for the Future, pp. 205–210 (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Rhydian Lewis
    • 1
  1. 1.Pryfysgol Caerdydd/Cardiff University, Cardiff Business School, Colum Drive, Cardiff, Wales 

Personalised recommendations