Abstract
The Social Golfer Problem has been extensively used by the constraint community in recent years as an example of a highly symmetric problem. It is an excellent problem for benchmarking symmetry breaking mechanisms such as SBDS or SBDD and for demonstrating the importance of the choice of the right model for one problem. We address in this paper a specific instance of the Golfer Problem well known as Kirkman’s Schoolgirl Problem and list a collection of techniques and tricks to find efficiently all its unique solutions. In particular, we propose SBDD+, a generic improvement over SBDD which allows a deep pruning when a symmetry is detected during the search. Our implementation of the presented techniques improves previously published results by an order of magnitude for CPU time as well as for number of backtracks. It computes the seven unique solutions of Kirkman’s problem in a few seconds.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Barnier, N., & Brisset, P. (2001). FaCiLe: A functional constraint library. In Proceedings of CICLOPS2001. Paphos, pages 52–66.
Cohen, M. B., Colbourn, C. J., Ives, L. A., & Ling, A. C. H. (2001). Kirkman triple systems of order 21 with nontrivial automorphism group. Math. Comput.
Walsh, T., ed. (2001). CP’01: 7th International Conference on Principle and Practice of Constraint Programming, number 2239 in LNCS, Springer-Verlag, Paphos, Cyprus.
CPAIOR’02: Fourth International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems, Le Croisic, France, 2002.
Fahle, T., Schamberger, S., & Sellmann, M. Symmetry breaking. In CP’01 [3], pages 93–107.
Focacci, F., & Milano, M. Global cut framework for removing symmetries. In CP’01 [3], pages 77–92.
Gent, I., Walsh, T., & Selman, B. CSPlib: A problem library for constraints. http://www.csplib.org.
Gent, I. P., & Barbara, S. (2000). Symmetry breaking during search in contraint programming. In Horn, W., ed., EACI’2000, pages 599–603.
Gervet, C. (1997). Interval propagation to reason about sets: Definition and implementation of a practical language. Constraints 1(3): 191–244. http://www.icparc.ic.ac.uk/~cg6.
Gervet, C., & Sadler, A. (2004). Global Filtering for the Disjointness Constraint on Fixed Cardinality Sets. Technical Report, ICPARC-04-02 (March).
Hopcroft, J., & Karp, R. (1973). An n5/2 algorithm for maximum matching in bipartite graphs. SIAM J Comput 2(4): 225–231.
Kirkman, T. P. (1850). Note on an unanswered prize question. Cambridge Dublin Math J 5: 255–262.
Hall, M. Jr. (1983). Combinatorial Theory, 2nd Edition. Wiley Classics Library.
McKay, B. D. (1981). Practical graph isomorphism. Congr. Numerantium 30: 45–87.
Prestwich, S. Randomised backtracking for linear pseudo-boolean constraint problems. In CPAIOR’02 [4], pages 7–19.
Régin, J.-C. (1996). Generalized arc consistency for global cardinality constraint. In Proceedings of the Thirteenth National Conference on Artificial Intelligence.
Sadler, A., & Gervet, C. (2001). Global reasoning on sets. In Formul’01, Workshop Modelling and Problem Formulation.
Sellmann, M., & Harvey, W. Heuristic constraint propagation. In CPAIOR’02 [4], pages 191–204.
Smith, B. (2001). Reducing symmetry in a combinatorial design problem. In CPAIOR’01, pages 351–359 (April). http://www.icparc.ic.ac.uk/cpAIOR01.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Barnier, N., Brisset, P. Solving Kirkman’s Schoolgirl Problem in a Few Seconds. Constraints 10, 7–21 (2005). https://doi.org/10.1007/s10601-004-5305-9
Issue Date:
DOI: https://doi.org/10.1007/s10601-004-5305-9