|
|
|
Toni Mancini, Davide Micaletto, Fabio Patrizi, Marco Cadoli
Dipartimento di Informatica e Sistemistica
Università di Roma "La Sapienza"
via Salaria 113, I-00198 Roma, Italy
Appeared in
Constraints, 13(4), pages 407-436, 2008.
Web appendix
[CSPLib #] Go to the CSPLib page for this problem An order 'n' magic
square is a 'n' by 'n' matrix containing the numbers 1 to n2, with each row, column
and main diagonal equal the same sum.
Given a positive integer 'n', the problem
amounts to find a 'n' order magic square.
- n, the order of the magic square to find
The set of all possible assignments of integers from 1 to n2 to the n2 entries of the matrix- C1: Numbers assigned to entries of the matrix must be all different
- C2: Each row, column and main diagonal equal the same sum
Problem specifications
Specification | OPL | DLV | LPARSE |
BASE: Base specification |
|
|
|
SBSA: Symmetry-breaking by selective assignment |
|
|
|
SBLI: Symmetry-breaking by lowest index ordering |
|
|
|
SBSO: Symmetry-breaking by selective ordering |
|
|
|
AUX: Addition of auxiliary predicates |
|
|
|
GCAD: Exploitation of alldifferent() global constraint |
| -- | -- |
AUX-SBSA: Addition of auxiliary predicates plus Symmetry-breaking by selective assignment |
|
|
|
AUX-SBLI: Addition of auxiliary predicates plus Symmetry-breaking by lowest index ordering |
|
|
|
AUX-GCAD: Addition of auxiliary predicates plus Exploitation of alldifferent() global constraint |
| -- | -- |
AUX-GCAD-SBLI: Addition of auxiliary predicates plus Exploitation of alldifferent() global constraint plus Symmetry-breaking by lowest index ordering |
| -- | -- | Return to the problem list
|
[This web site could never be realised without the sophisticated features of a pure text editor and the extreme power of 220V]
|