#!/bin/bash
make
-for i in 2000 107 1001 387 372 792 747 38 754 2; do
+for i in 2000 107; do
echo "Problem: $i"
- time ./main -v ../sokobanzip/screens/screen.$i
+ time ./main ../sokobanzip/screens/screen.$i
done
\ForEach{$R_i$}{
$V_{new}\leftarrow BDDapply(\vee, V_{new}, BDDrelprod(V_{new}, R_i)$\;
}
- \lIf{$BDDsatcount(BDDand(G, new))>0$}{$break$}
+ \lIf{$BDDsatcount(BDDand(G, V_{new}))>0$}{$break$}
}
\end{algorithm}
\section{Results \& How-to}
\subsection{Results}
-This approach is not very efficient yet. While it is a bit faster than the
-previous \textsc{NuSMV} approach it is not capable of handling bigger screens.
+This approach is not very efficient yet. Below are some execution times for
+several screens:
\begin{tabular}{lll}
\toprule
- Screen no. & \textsc{NuSMV} & This program\\
+ Screen no. & Boxes & Size & Time\\
\midrule
- $2000$ & $n$ & $n$\\
+ $2000$ & $1$ & $12$ & $0.05s$\\
+ $107$ & $3$ & $16$ & $1.19s$\\
\bottomrule
\end{tabular}