spellcheck

diff --git a/report2/implementation.tex b/report2/implementation.tex
index 273bef9..f3b8474 100644 (file)
--- a/report2/implementation.tex
+++ b/report2/implementation.tex
@@ -30,12 +30,12 @@ one-tile relation (changes only one tile), a two-tile relation (changes only
 two tiles) and a three-tile relation (transforms three tiles per transition
 simultaneously). In order to generate transition relations, we iterate through
 a screen and for each tile we check neighbouring space with the purpose of
-generating only the relevant relations. For example, if we concider a tile in
+generating only the relevant relations. For example, if we consider a tile in
 the top-left corner, there is no need to generate one or two-tiled transition
 relations which can transform tiles to the left or to the right of that given
 tile. For each possible direction of agent movement, we define a $\delta$ and a
 $\gamma$ variables which represent the change in coordinate values respectively
-for the next position and the position next to the next postition.
+for the next position and the position next to the next position.
 $$\delta_{(x,y)}(m)=\begin{cases}
        (x-1, y) & \text{if } m = left\\
        (x+1, y) & \text{if } m = right\\

diff --git a/report2/results.tex b/report2/results.tex
index cd371a8..1d244a7 100644 (file)
--- a/report2/results.tex
+++ b/report2/results.tex
@@ -56,10 +56,10 @@ Positional arguments:
 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
+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
+the user whether the LURD leads to a solvable state. Note that when the LURD is
 empty the program behaves like there was no LURD given.
 
 \subsection{Evaluation}
@@ -72,7 +72,7 @@ debugging a lot harder. One of those errors was malformed dot output for
 printing BDDs. In the meantime we have made a pullrequest to fix that.
 
 Secondly, due to the relatively short introduction to BDDs the gap between our
-knowlegde and the knowledge required to build such a solver is quite big. This
+knowledge and the knowledge required to build such a solver is quite big. This
 lead to startup problems.
 
 The work was divided evenly in the beginning of the project. When we noticed