From 6acf7d6212f62558166315c346ef8cdb0fba7d3b Mon Sep 17 00:00:00 2001
From: "Tian Cheng \"Riccardo\" Xia" <35894453+NotXia@users.noreply.github.com>
Date: Fri, 27 Oct 2023 15:44:30 +0200
Subject: [PATCH] Typo

---
 src/fundamentals-of-ai-and-kr/module1/sections/_search.tex | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/fundamentals-of-ai-and-kr/module1/sections/_search.tex b/src/fundamentals-of-ai-and-kr/module1/sections/_search.tex
index 8911e9d..2646150 100644
--- a/src/fundamentals-of-ai-and-kr/module1/sections/_search.tex
+++ b/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}
\ No newline at end of file
+\end{description}