Jip J. Dekker
fad1b07018
git-subtree-dir: software/minizinc git-subtree-split: 4f10c82056ffcb1041d7ffef29d77a7eef92cf76
73 lines
1.7 KiB
MiniZinc
73 lines
1.7 KiB
MiniZinc
/***
|
|
!Test
|
|
expected:
|
|
- !Result
|
|
solution: !Solution
|
|
puzzle:
|
|
- [5, 9, 3, 7, 6, 2, 8, 1, 4]
|
|
- [2, 6, 8, 4, 3, 1, 5, 7, 9]
|
|
- [7, 1, 4, 9, 8, 5, 2, 3, 6]
|
|
- [3, 2, 6, 8, 5, 9, 1, 4, 7]
|
|
- [1, 8, 7, 3, 2, 4, 9, 6, 5]
|
|
- [4, 5, 9, 1, 7, 6, 3, 2, 8]
|
|
- [9, 4, 2, 6, 1, 8, 7, 5, 3]
|
|
- [8, 3, 5, 2, 4, 7, 6, 9, 1]
|
|
- [6, 7, 1, 5, 9, 3, 4, 8, 2]
|
|
***/
|
|
|
|
%
|
|
%-----------------------------------------------------------------------------%
|
|
% Sudoku for squares of arbitrary size N = (S x S)
|
|
%-----------------------------------------------------------------------------%
|
|
|
|
int: S;
|
|
int: N = S * S;
|
|
|
|
|
|
array[1..N,1..N] of var 1..N: puzzle;
|
|
|
|
|
|
include "alldifferent.mzn";
|
|
|
|
% All cells in a row, in a column, and in a subsquare are different.
|
|
constraint
|
|
forall(i in 1..N)( alldifferent(j in 1..N)( puzzle[i,j] ))
|
|
/\
|
|
forall(j in 1..N)( alldifferent(i in 1..N)( puzzle[i,j] ))
|
|
/\
|
|
forall(i,j in 1..S)
|
|
( alldifferent(p,q in 1..S)( puzzle[S*(i-1)+p, S*(j-1)+q] ));
|
|
|
|
|
|
solve satisfy;
|
|
|
|
|
|
output [ "sudoku:\n" ] ++
|
|
[ show(puzzle[i,j]) ++
|
|
if j = N then
|
|
if i mod S = 0 /\ i < N then "\n\n" else "\n" endif
|
|
else
|
|
if j mod S = 0 then " " else " " endif
|
|
endif
|
|
| i,j in 1..N ];
|
|
|
|
%-----------------------------------------------------------------------------%
|
|
%
|
|
% The data for the puzzle that causes satz to make 1 backtrack (normally none
|
|
% are made).
|
|
%
|
|
|
|
S=3;
|
|
puzzle=[|
|
|
_, _, _, _, _, _, _, _, _|
|
|
_, 6, 8, 4, _, 1, _, 7, _|
|
|
_, _, _, _, 8, 5, _, 3, _|
|
|
_, 2, 6, 8, _, 9, _, 4, _|
|
|
_, _, 7, _, _, _, 9, _, _|
|
|
_, 5, _, 1, _, 6, 3, 2, _|
|
|
_, 4, _, 6, 1, _, _, _, _|
|
|
_, 3, _, 2, _, 7, 6, 9, _|
|
|
_, _, _, _, _, _, _, _, _|
|
|
|];
|
|
|