Abstract
Constraint Programming (CP) is a powerful paradigm for modeling and solving Complex Combinatorial Problems (generally issued from Decision Making). In this work, we model the known Sudoku puzzle as a Constraint Satisfaction Problems and solve it with CP comparing the performance of different Variable and Value Selection Heuristics in its Enumeration phase. We encourage this kind of benchmark problem because it may suggest new techniques in constraint modeling and solving of complex systems, or aid the understanding of its main advantages and limits.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Apt, K.: Principles of constraint programming (2003), http://citeseer.ist.psu.edu/apt03principles.html
Haralick, R., Elliot, G.: Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence 14, 263–313 (1980)
Monfroy, E., Castro, C., Crawford, B.: Adaptive enumeration strategies and metabacktracks for constraint solving. In: Yakhno, T., Neuhold, E.J. (eds.) ADVIS 2006. LNCS, vol. 4243, pp. 354–363. Springer, Heidelberg (2006)
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
Smith, B.: Succeed-first or Fail-first: A Case Study in Variable and Value Ordering. Technical Report 96.26 (1996), http://citeseer.ist.psu.edu/194952.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Crawford, B., Castro, C., Monfroy, E. (2009). Solving Sudoku with Constraint Programming. In: Shi, Y., Wang, S., Peng, Y., Li, J., Zeng, Y. (eds) Cutting-Edge Research Topics on Multiple Criteria Decision Making. MCDM 2009. Communications in Computer and Information Science, vol 35. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02298-2_52
Download citation
DOI: https://doi.org/10.1007/978-3-642-02298-2_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02297-5
Online ISBN: 978-3-642-02298-2
eBook Packages: Computer ScienceComputer Science (R0)