From dbbffcd6a2e04269a39840b39f9b4f2d8dee53f4 Mon Sep 17 00:00:00 2001 From: Mart Lubbers Date: Thu, 21 Apr 2016 18:35:25 +0200 Subject: [PATCH] update --- report2/implementation.tex | 3 +++ report2/results.tex | 12 +++++++++++- 2 files changed, 14 insertions(+), 1 deletion(-) diff --git a/report2/implementation.tex b/report2/implementation.tex index 40bef7f..b4a1d77 100644 --- a/report2/implementation.tex +++ b/report2/implementation.tex @@ -75,6 +75,9 @@ $$next(i_1, i_2, i_3)=\left\{\begin{array}{lp{2pt}l} Encoding the goal state is very trivial. Just make sure all $target$ tiles are $targetbox$ tiles. +\subsection{Lurd extraction} +%TODO + \subsection{Example} For example, take the toy screen shown as the first representation in Listing~\ref{lst:toy}. When the screen is parsed the unreachable space is first diff --git a/report2/results.tex b/report2/results.tex index e8b29e7..c152f71 100644 --- a/report2/results.tex +++ b/report2/results.tex @@ -24,7 +24,7 @@ Usage: ./main [opts] [FILE] Options: - -l LURD LURD verification strategy + -l LURD initial LURD -v enable verbose output -h show this help @@ -32,3 +32,13 @@ Positional arguments: FILE zero or one sokoban screens when no file is specified stdin will be used \end{lstlisting} + +\subsection{Extra 1: Initial LURD} +Using the \texttt{-l} option the user can give a initial LURD to the program. +LURD stands for Left, Up, Right, Down sequence and is a string consisting only +of $l,u,r,d$ characters and it specifies the initial moves to be taken by the +agent. To achieve this we simple for every character in the lurd update the +initial state with the relative product of the transitions belonging to the +correct direction. After that the problem is solved as usual and thus notifying +the user wether the LURD leads to a solvable state. Note that when the LURD is +empty the program behaves like there was no LURD given. -- 2.20.1