The CSPLib site is mirrored in England and the United States

CSPLib: a problem library for constraints

maintaiend by  Ian P. Gent
ipg@dcs.st-and.ac.uk
and  Toby Walsh
tw@cs.york.ac.uk
with help from  Bart Selman
selman@cs.cornell.edu

Combinatorial mathematics

prob003: quasigroup existence.

prob005: low autocorrelation binary sequences.

prob006: Golomb rulers.

prob007: all-interval series.

prob009: perfect square placement.

prob015: Schur's lemma.

prob017: Ramsey numbers.

prob019: magic squares and sequences.

prob023: magic hexagon.

prob024: Langford's number problem.

prob025: Lam's problem.

prob028: balanced incomplete block designs.

prob029: prime queen attacking problem.

prob033: word design for DNA computing on surfaces.

prob035: Molnar's problem.

prob036: fixed length error correcting codes.

prob041: n-fractions puzzle.

prob044: Steiner triple systems.

prob045: covering arrays.


Back to subject classification