From a4f6eb5c7804a81094fe048488198fb9a8154f03 Mon Sep 17 00:00:00 2001
From: Laaksonen Antti H S <ahslaaks@lx7-cs-03.pc.helsinki.fi>
Date: Tue, 3 Jul 2018 15:11:36 +0300
Subject: [PATCH] Fix algorithm implementation [closes #61]

---
 chapter10.tex | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/chapter10.tex b/chapter10.tex
index a9d9765..b355665 100644
--- a/chapter10.tex
+++ b/chapter10.tex
@@ -728,16 +728,16 @@ pair<int,int> best[1<<N];
 \end{lstlisting}
 that contains for each subset $S$
 a pair $(\texttt{rides}(S),\texttt{last}(S))$.
-For an empty group, no rides are needed:
+We set the value for an empty group as follows:
 \begin{lstlisting}
-best[0] = {0,0};
+best[0] = {1,0};
 \end{lstlisting}
 Then, we can fill the array as follows:
 
 \begin{lstlisting}
 for (int s = 1; s < (1<<n); s++) {
-    // initial value: n rides are needed
-    best[s] = {n,0};
+    // initial value: n+1 rides are needed
+    best[s] = {n+1,0};
     for (int p = 0; p < n; p++) {
         if (s&(1<<p)) {
             auto option = best[s^(1<<p)];