Typo

src/fundamentals-of-ai-and-kr/module1/sections/_search.tex

@@ -193,7 +193,7 @@ This allows to avoid infinite branches (i.e. loops).
 
 \subsection{Iterative deepening}
 \marginnote{Iterative deepening}
-Rus a depth-limited search by trying all possible depth limits.
+Runs a depth-limited search by trying all possible depth limits.
 It is important to note that each iteration is executed from scratch (i.e. a new execution of depth-limited search).
 
 \begin{algorithm}
@@ -406,4 +406,4 @@ The heuristic $g(n)$ evaluates the minimum distance from the root to the node $n
     \begin{theorem}
         If $h$ is a consistent heuristic, A$^*$ on graphs is optimal.
     \end{theorem}
-\end{description}
+\end{description}