XCSP 2.1 Benchmarks

---

socialGolfersExtConvert

Lecoutre's category
ACAD (Academic instances) - Social Golfers
Lecoutre's tooltips
This is a series of instances proposed by Daniel le Berre and Ines Lynce for the 2006 CSP Solver Competition. The original problem can be described by enumerating four constraints as follows: a) The golf club has 32 members. b) Each member plays golf once a week. c) Golfers always play in groups of 4. d) No golfer plays in the same group as any other golfer twice. It can be easily generalized. An instance to this geenralized problem is then characterized by a triple w-p-g, where w is the number of weeks, p is the number of players per group and g is the number of groups. The encoding used here is the one proposed by Walser and is available on CSPLIB.
Source
http://www.cril.univ-artois.fr/~lecoutre/research/benchmarks/socialGolfers.tgz
Comments
None

Number of instances: 10 (0 processed, 6 partially processed, 4 failed)

Processing completed

Partially processed
socialGolfer-6-3-5-ext
socialGolfer-6-3-6-ext
socialGolfer-6-3-7-ext
socialGolfer-6-3-8-ext
socialGolfer-6-4-5-ext
socialGolfer-6-4-6-ext

Processing failed
socialGolfer-10-4-8
socialGolfer-10-4-8-ext
socialGolfer-6-4-7
socialGolfer-6-4-7-ext