Encoding blockedqueens_tight.lparse

Name	blockedqueens_tight.lparse
Class Tree	[Root] Unclassified (114) BlockedN-QueensCompetition (4)
Submitter	Martin Gebser
Author	Gayathri Namasivayam and Miroslaw Truszczynski
Description	An encoding for N-queens problem Authors: Gayathri Namasivayam and Miroslaw Truszczynski Affiliation: University of Kentucky Email: {gayathri, mirek}@cs.uky.edu
Created	2009-03-30 13:03
Modified	2009-03-09 16:56
Languages	lparse
Language Features	Cardinality constraints
Compatible Instance Classes	BlockedN-QueensCompetition
Input Predicates	block/2 num/1
Output Predicates	queen/2
Encoding Parameter
Standalone	No
Tags
Attributes
Content	%% %% An encoding for N-queens problem %% #const n=48. % 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