From 6d2ae1b3a3a068979613168d8f4b56d357314326 Mon Sep 17 00:00:00 2001
From: Luca Domeniconi <34924739+liuktc@users.noreply.github.com>
Date: Tue, 10 Dec 2024 12:19:12 +0100
Subject: [PATCH] Update _planning.tex

Sono pignolo <3
---
 .../fundamentals-of-ai-and-kr/module1/sections/_planning.tex  | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/year1/fundamentals-of-ai-and-kr/module1/sections/_planning.tex b/src/year1/fundamentals-of-ai-and-kr/module1/sections/_planning.tex
index 5758f04..4db8608 100644
--- a/src/year1/fundamentals-of-ai-and-kr/module1/sections/_planning.tex
+++ b/src/year1/fundamentals-of-ai-and-kr/module1/sections/_planning.tex
@@ -559,7 +559,7 @@ def resolveThreats(plan):
 
         \item Now, we choose as action $\texttt{BUY(X, drill)}$ and as unsolved precondition $\texttt{sells(X, drill)}$.
             This can be solved from the action $\texttt{start}$ with effect $\texttt{sells(hws, drill)}$.
-            We make the substitution $\texttt{X}/\texttt{drill}$ and 
+            We make the substitution $\texttt{X}/\texttt{hws}$ and 
             add $\langle \texttt{start}, \texttt{BUY(hws, drill)}, \texttt{sells(hws, drill)} \rangle$ to the causal links.
             The same process can be repeated for $\texttt{BUY(X, milk)}$ and $\texttt{BUY(X, banana)}$:
             \begin{center}
@@ -1036,4 +1036,4 @@ Heuristic planner based on Graphplan, hill climbing and A$^*$.
             \item If there is a successor $S'$ better than $S$, move into it and return to point 1.
             \item Otherwise, run a complete A$^*$ search.
         \end{enumerate}
-\end{description}
\ No newline at end of file
+\end{description}