Abstract
Icosoku is a challenging and interesting puzzle that exhibits highly symmetrical and combinatorial nature. In this paper, we pose the questions derived from the puzzle, but with more difficulty and generality. In addition, we also present a constraint programming model for the proposed questions, which can provide the answers to our first two questions. The purpose of this paper is to share our preliminary result and problems to encourage researchers in both group theory and constraint communities to consider this topic further.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
This paper follows the naming convention of Choco solver. The other solvers might use a different name for the same constraint. For instance, the scalar constraint is called the linear and LinearInt constraint in Geode and JaCoP, respectively.
References
Dechter, R.: Constraint Processing. Elsevier Morgan Kaufmann (2003). http://www.elsevier.com/wps/find/bookdescription.agents/678024/description
Harvey, W.: CSPLib problem 010: social golfers problem (2002). http://www.csplib.org/Problems/prob010. Accessed 28 Apr 2019
Jefferson, C., Akgün, Ö.: CSPLib: a problem library for constraints (1999). http://www.csplib.org/. Accessed 28 Apr 2019
Kuchcinski, K., Szymanek, R.: JaCoP Documentation. Lund University (2017). https://osolpro.atlassian.net/wiki/spaces/JACOP/pages/24248322/JaCoP+Overview
Lecoutre, C.: Constraint Networks: Techniques and Algorithms. Wiley, London (2009)
Liu., K., Löffler., S., Hofstedt., P.: Solving the social golfers problems by constraint programming in sequential and parallel. In: Proceedings of the 11th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART. INSTICC, pp. 29–39. SciTePress (2019). https://doi.org/10.5220/0007252300290039
Prud’homme, C., Fages, J.G., Lorca, X.: Choco Documentation. TASC - LS2N CNRS UMR 6241, COSLING S.A.S. (2017). http://www.choco-solver.org
Puget, J.: Symmetry breaking revisited. Constraints 10(1), 23–46 (2005). https://doi.org/10.1007/s10601-004-5306-8
Rossi, F., van Beek, P., Walsh, T. (eds.): Handbook of Constraint Programming, Foundations of Artificial Intelligence, vol. 2. Elsevier (2006). http://www.sciencedirect.com/science/bookseries/15746526/2
Schulte, C., Tack, G., Lagerkvist, M.Z.: Modeling and programming with Gecode. Gecode Team (2017). https://www.gecode.org/
Acknowledgment
We should like to thank our colleague Ekkehard Köhler for drawing our attention to the icosoku problem.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Liu, K., Löffler, S., Hofstedt, P. (2020). Exploring Properties of Icosoku by Constraint Satisfaction Approach. In: Hofstedt, P., Abreu, S., John, U., Kuchen, H., Seipel, D. (eds) Declarative Programming and Knowledge Management. INAP WLP WFLP 2019 2019 2019. Lecture Notes in Computer Science(), vol 12057. Springer, Cham. https://doi.org/10.1007/978-3-030-46714-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-030-46714-2_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-46713-5
Online ISBN: 978-3-030-46714-2
eBook Packages: Computer ScienceComputer Science (R0)