Encoding lparse encoding optimized

Name	lparse encoding optimized
Class Tree	[Root] Puzzles (51) n-Queens (7) BlockedN-Queens (4)
Submitter	Martin Gebser
Author
Description	This is an optimized encoding of the Blocked n-Queens problem using cardinality constraints. The size after grounding is O(n^2).
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	%% %% An optimal encoding for N-queens problem %% % Each row has exactly one queen 1{ queen(R,C) : num(C) } 1 :- num(R). % Each column has exactly one queen 1{ queen(R,C) : num(R) } 1 :- num(C). % Each ascending diagonal has at most one queen { queen(R+I-1, I) : num(I;R+I-1) } 1 :- num(R). { queen(R-I+1, I) : num(I;R-I+1) } 1 :- num(R). % Each descending diagonal has at most one queen { queen(I, C+I-1) : num(I;C+I-1) } 1 :- num(C). { queen(n-I+1, C+I-1) : num(I;n-I+1;C+I-1) } 1 :- num(C). % Blocked queens :- queen(R,C), block(R,C).

Actions