mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-06 17:44:08 +00:00
Code Activity

.NET Example: Sudoku example bugfix. Many thanks to Ilya Mironov for reporting this issue.

Browse source 
Signed-off-by: Christoph M. Wintersteiger <cwinter@microsoft.com>
This commit is contained in:
Christoph M. Wintersteiger 2013-07-02 12:57:54 +01:00
parent b7c2d9054b
commit 210bca8f45
1 changed files with 9 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

12
examples/dotnet/Program.cs
View file

@ -474,7 +474,7 @@ namespace test_mapi
cells_c[i] = new BoolExpr[9]; cells_c[i] = new BoolExpr[9];
for (uint j = 0; j < 9; j++) for (uint j = 0; j < 9; j++)
cells_c[i][j] = ctx.MkAnd(ctx.MkLe(ctx.MkInt(1), X[i][j]), cells_c[i][j] = ctx.MkAnd(ctx.MkLe(ctx.MkInt(1), X[i][j]),
ctx.MkLe(X[i][j], ctx.MkInt(9))); ctx.MkLe(X[i][j], ctx.MkInt(9)));
} }
// each row contains a digit at most once // each row contains a digit at most once
@ -485,7 +485,13 @@ namespace test_mapi
// each column contains a digit at most once // each column contains a digit at most once
BoolExpr[] cols_c = new BoolExpr[9]; BoolExpr[] cols_c = new BoolExpr[9];
for (uint j = 0; j < 9; j++) for (uint j = 0; j < 9; j++)
cols_c[j] = ctx.MkDistinct(X[j]); {
IntExpr[] column = new IntExpr[9];
for (uint i = 0; i < 9; i++)
column[i] = X[i][j];
cols_c[j] = ctx.MkDistinct(column);
}
// each 3x3 square contains a digit at most once // each 3x3 square contains a digit at most once
BoolExpr[][] sq_c = new BoolExpr[3][]; BoolExpr[][] sq_c = new BoolExpr[3][];
@ -2087,7 +2093,7 @@ namespace test_mapi
{ {
QuantifierExample3(ctx); QuantifierExample3(ctx);
QuantifierExample4(ctx); QuantifierExample4(ctx);
} }
Log.Close(); Log.Close();
if (Log.isOpen()) if (Log.isOpen())