0

以下模型适用于 langfords 问题

int: m = 2;
int: n = 3;

set of int: DOM = 1..m*n;
set of int: RAN = 1..n;

array [DOM] of var 1..n: nos;

constraint forall(j in DOM, k in j+1..m*n) (nos[j] = nos[k] /\ forall(l in j + 1 .. k - 1)(nos[l] != nos[k]) -> k - j = nos[j] + 1);

constraint forall(r in RAN)( sum([1 | i in DOM where nos[i] = r]) = m);

solve satisfy;

然而,更自然的阅读约束

constraint forall(r in RAN)( card({i | i in DOM where nos[i] = r}) = m);

失败并出现错误

MiniZinc: type error: no function or predicate with this signature found: `card(var opt set of int)'

有什么建议么?

4

1 回答 1

0

您的设置大小取决于 a var,这意味着该类型是您想象var opt的那样。var

欲了解更多信息,请阅读此处:

MiniZinc:类型错误:预期 `array[int] of int',实际 `array[int] of var opt int

于 2016-10-15T19:26:29.860 回答