Encoding lparse encoding cardinality

Name	lparse encoding cardinality
Class Tree	[Root] Puzzles (51) n-Queens (7) BlockedN-Queens (4)
Submitter	Martin Gebser
Author
Description	This is a straightforward encoding of the Blocked n-Queens problem using cardinality constraints. The size after grounding is O(n^3).
Created	2009-03-30 13:03
Modified	2008-11-29 00:10
Languages	lparse
Language Features
Compatible Instance Classes
Input Predicates
Output Predicates
Encoding Parameter
Standalone	No
Tags
Attributes
Content	%% n-queens problem %% Domain predicate "d" specifies the number of queens and the dimensions %% of the board. The main predicate is the predicate "q". Atom "q(X,Y)" %% represents the fact that there is a queen in the position (X,Y). % Exactly one queen in each row 1 { queen(X,Y):num(Y) } 1 :- num(X). % Exactly one queen in each column 1 { queen(X,Y):num(X) } 1 :- num(Y). % No two queens on an diagonal :- num(X;Y;X1;Y1), queen(X,Y), queen(X1,Y1), X < X1, Y != Y1, abs(X - X1) == abs(Y - Y1). :- queen(X,Y), block(X,Y).

Actions