XCSP 2.1 Benchmarks

---

queensKnightsExtConvert

Lecoutre's category
ACAD (Academic instances) - Queens-Knights
Lecoutre's tooltips
The Queens-Knights problem is the task of putting on a chessboard of size n*n, q queens and k knights such that no two queens can attack each other and all knights form a cycle (when considering knight moves). See [Boussemart-Hemery-Lecoutre-Sais, Boosting systematic search by weighting constraints, ECAI'04]. In one version of this problem (identified by ``add''), a square of the chessboard can be shared by both a queen and a knight and in another one (identified by ``mul''), it is not allowed. For the first version, each instance is denoted by queensKnights-n-k-add while for the second one, it is denoted by queensKnights-n-k-mul.
Source
http://www.cril.univ-artois.fr/~lecoutre/research/benchmarks/queensKnights.tgz
Comments
None

Number of instances: 19 (11 processed, 3 partially processed, 5 failed)

Processing completed
queensKnights-10-5-add_ext
queensKnights-10-5-mul_ext
queensKnights-12-5-add_ext
queensKnights-12-5-mul_ext
queensKnights-15-5-add_ext
queensKnights-15-5-mul_ext
queensKnights-20-5-add_ext
queensKnights-20-5-mul_ext
queensKnights-25-5-add_ext
queensKnights-8-5-add_ext
queensKnights-8-5-mul_ext

Partially processed
queensKnights-25-5-mul_ext
queensKnights-50-5-add_ext
queensKnights-50-5-mul_ext

Processing failed
queensKnights-100-5-add_ext
queensKnights-100-5-mul
queensKnights-100-5-mul_ext
queensKnights-80-5-add_ext
queensKnights-80-5-mul_ext