Replace appendix.tex

Thesis in Latex/appendix.tex

@@ -28,7 +28,6 @@ constraint if n = 0 then fak_n = 1 else fak_n = product([i| i in 1..n])
 endif;
 \end{minted}
 
-\newpage
 \subsection{Send Money}
 \subsubsection{Send More Money}
 \label{subsubsection:send_more_money}
@@ -48,7 +47,7 @@ send_more_money_minizinc([S,E,N,D,M,O,R,Y]) :-
                   FznState), 
     fzn_solve(FznState).
 \end{minted}
-\newpage
+
 \subsubsection*{A.2.1.4 Send More Money - MiniZinc mit Array}
 \label{subsubsection:send_more_money_minizinc_array}
 \begin{minted}[frame=lines,linenos]{prolog}
@@ -65,7 +64,7 @@ constraint          (1000*digits[1] + 100*digits[2] + 10*digits[3] + digits[4])
  
 solve satisfy;
 \end{minted}
-\newpage
+
 \subsubsection*{A.2.1.5 Send More Money - MiniZinc ohne alldifferent}
 \label{subsubsection:send_more_money_minizinc_ohne_alldifferent}
 \begin{minted}[frame=lines,linenos]{prolog}
@@ -105,12 +104,10 @@ constraint   (1000*s + 100*e + 10*n + d)
 solve satisfy;
 \end{minted}
 
-\newpage
 \subsubsection{Send Most Money}
 \label{subsubsection:send_most_money}
 \subsubsection*{A.2.2.1 CLP(FD)}
 \inputminted[frame=lines,linenos]{prolog}{send_most_money.pl}
-\newpage
 \subsubsection*{A.2.2.2 MiniZinc in MiniZincIDE}
 \label{subsubsection:send_most_money_minizincide}
 \inputminted[frame=lines,linenos]{prolog}{send_most_money.mzn}
@@ -124,7 +121,7 @@ send_most_money_minizinc([S,E,N,D,M,O,T,Y], MONEY) :-
                   FznState), 
     fzn_solve(FznState).
 \end{minted}
-\newpage
+
 \subsubsection*{A.2.2.4 Send Most Money - MiniZinc mit Array}
 \label{subsubsection:send_most_money_minizinc_array}
 \begin{minted}[frame=lines,linenos]{prolog}
@@ -145,7 +142,7 @@ constraint   (1000*digits[1] + 100*digits[2] + 10*digits[3] + digits[4])
  
 solve maximize money;
 \end{minted}
-\newpage
+
 \subsubsection*{A.2.2.5 Send Most Money - MiniZinc ohne alldifferent}
 \label{subsubsection:send_most_money_minizinc_ohne_alldifferent}
 \begin{minted}[frame=lines,linenos]{prolog}
@@ -187,14 +184,13 @@ constraint   (1000*s + 100*e + 10*n + d)
 solve maximize money;
 \end{minted}
 
-\newpage
 \subsection{Smuggler's Knapsack}
 \label{subsection:smugglers_knapsack}
 \subsubsection*{A.3.1 CLP(FD)}
 \inputminted[frame=lines,linenos]{prolog}{smugglers_knapsack.pl}
 \subsubsection*{A.3.2 MiniZinc in MiniZincIDE}
 \inputminted[frame=lines,linenos]{prolog}{smugglers_knapsack.mzn}
-\newpage
+
 \subsubsection*{A.3.3 MiniZinc in SICStus-Prolog}
 \begin{minted}[frame=lines,linenos]{prolog}
 :- use_module(library(zinc)).
@@ -218,7 +214,6 @@ constraint 15*items[1] + 10*items[2] + 7*items[3] >= profit;
 solve maximize 15*items[1] + 10*items[2] + 7*items[3];
 \end{minted}
 
-\newpage
 \subsection{Who Killed Agatha}
 \label{subsection:who_killed_agatha}
 \subsubsection*{A.4.1 CLP(FD)}
@@ -236,7 +231,6 @@ who_killed_agatha_minizinc(Killer) :-
         fzn_solve(FznState).
 \end{minted}
 
-\newpage
 \subsection{Zebra Puzzle}
 \label{subsection:zebra_puzzle}
 \subsubsection*{A.5.1 CLP(FD)}
@@ -260,12 +254,11 @@ zebra_puzzle_minizinc([Englaender,Spanier,Ukrainer,Norweger,Japaner,ZEBRA,WASSER
                       FznState), 
         fzn_solve(FznState).
 \end{minted}
-\newpage
+
 \subsubsection*{A.5.4 MiniZinc mit Arrays}
 \label{subsubsection:MiniZinc mit Arrays}
 \inputminted[frame=lines,linenos]{prolog}{zebra_puzzle_arrays.mzn}
 
-\newpage
 \subsection{Seseman's Convent}
 \label{subsection:sesemans_convent}
 \subsubsection*{A.6.1 CLP(FD)}
@@ -306,7 +299,6 @@ constraint digits[1] + digits[2] + digits[3] + digits[4]
 solve satisfy
 \end{minted}
 
-\newpage
 \subsection{Subset Sum}
 \label{subsection:subset_sum}
 \subsubsection*{A.7.1 CLP(FD)}
@@ -314,12 +306,11 @@ solve satisfy
 \subsubsection*{A.7.2 MiniZinc in MiniZincIDE}
 \inputminted[frame=lines,linenos]{prolog}{subset_sum.mzn}
 
-\newpage
 \subsection{Magic Hexagon}
 \label{subsection:magic_hexagon}
 \subsubsection*{A.8.1 CLP(FD)}
 \inputminted[frame=lines,linenos]{prolog}{magic_hexagon.pl}
-\newpage
+
 \subsubsection*{A.8.2 MiniZinc in MiniZincIDE}
 \inputminted[frame=lines,linenos]{prolog}{magic_hexagon.mzn}
 \subsubsection*{A.8.3 MiniZinc in SICStus-Prolog}
@@ -327,7 +318,7 @@ solve satisfy
 :- use_module(library(zinc)).
 
 magic_hexagon_minizinc([A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S]) :-
-        mzn_load_file('/home/amin/Schreibtisch/Bachelorarbeit/MiniZinc/magic_hexagon.mzn', 
+        mzn_load_file('magic_hexagon.mzn', 
                       [variables([a=A,b=B,c=C,d=D,e=E,f=F,g=G,h=H,i=I,j=J,k=K,l=L,m=M,
                                   n=N,o=O,p=P,q=Q,r=R,s=S])], 
                       FznState), 
@@ -376,7 +367,6 @@ constraint sum([numbers[8], numbers[13], numbers[17]]) = sum;
 solve satisfy;
 \end{minted}
 
-\newpage
 \subsection{Magic Square}
 \label{subsection:magic_square}
 \subsubsection*{A.9.1 CLP(FD)}
@@ -393,7 +383,6 @@ magic_square_minizinc(N,Squares) :-
         fzn_solve(FznState).
 \end{minted}
 
-\newpage
 \subsection{N Queens}
 \label{subsection:n_queens}
 \subsubsection*{A.10.1 CLP(FD)}
@@ -410,7 +399,6 @@ n_queens_minizinc(N,Queens) :-
         fzn_solve(FznState).
 \end{minted}
 
-\newpage
 \subsection{Sudoku}
 \label{subsection:sudoku}
 \subsubsection*{A.11.1 CLP(FD)}
@@ -418,7 +406,6 @@ n_queens_minizinc(N,Queens) :-
 \subsubsection*{A.11.2 MiniZinc in MiniZincIDE}
 \inputminted[frame=lines,linenos]{prolog}{sudoku.mzn}
 
-\newpage
 \subsection{Euler's Officer Problem}
 \label{subsection:eulers_officer_problem}
 \subsubsection*{A.12.1 CLP(FD)}
@@ -436,7 +423,6 @@ officer_problem_minizinc(N,Square) :-
         fzn_solve(FznState).
 \end{minted}
 
-\newpage
 \subsection{K Dominating Set}
 \label{subsection:k_dominating_set}
 \subsubsection*{13.1 CLP(FD)}