1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 | % % Fractions problem in MiniZinc. % % Prolog benchmark problem (BProlog) % """ % Find distinct non-zero digits such that the following equation holds: % A D G % ------ + ----- + ------ = 1 % B*C E*F H*I % """ % % This MiniZinc model was created by Hakan Kjellerstrand, hakank@gmail.com % See also my MiniZinc page: http://www.hakank.org/minizinc % % Licenced under CC-BY-4.0 : http://creativecommons.org/licenses/by/4.0/ include "globals.mzn" ; var 1..9: A; var 1..9: B; var 1..9: C; var 1..9: D; var 1..9: E; var 1..9: F; var 1..9: G; var 1..9: H; var 1..9: I; array [1..9] of var 1..9: Vars=[A,B,C,D,E,F,G,H,I]; var 1..81: D1; var 1..81: D2; var 1..81: D3; % solve satisfy; solve :: int_search(Vars ++ [D1,D2,D3], first_fail, indomain_min, complete) satisfy ; constraint all_different(Vars) /\ D1 = 10*B+C /\ D2 = 10*E+F /\ D3 = 10*H+I /\ A*D2*D3 + D*D1*D3 + G*D1*D2 = D1*D2*D3 /\ % break the symmetry A*D2 >= D*D1 /\ D*D3 >= G*D2 /\ %redundant constraints 3*A >= D1 /\ 3*G <= D2 ; output [ show (Vars), "\n" ] ; |