Updated search-data.json to accomodate include_relative files

sachin10101998 · sachin10101998 · commit 058e4e4f9bd2 · 2019-08-05T17:16:08.000+05:30
diff --git a/.jekyll-metadata b/.jekyll-metadata
diff --git a/_site/advanced-search-exercises/ex_11/index.html b/_site/advanced-search-exercises/ex_11/index.html
@@ -164,6 +164,13 @@ <h3 class="masthead-title">
 <script type="text/javascript" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.0/MathJax.js?config=TeX-AMS-MML_HTMLorMML">
 </script>
 
+<div id="hiddden">
+
+Consider the sensorless version of the
+erratic vacuum world. Draw the belief-state space reachable from the
+initial belief state $\{ 1,3,5,7 \}$, and explain why the problem
+is unsolvable.
+</div>
 
   </div>
   <div class="card">
diff --git a/_site/advanced-search-exercises/ex_13/index.html b/_site/advanced-search-exercises/ex_13/index.html
@@ -164,6 +164,33 @@ <h3 class="masthead-title">
 <script type="text/javascript" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.0/MathJax.js?config=TeX-AMS-MML_HTMLorMML">
 </script>
 
+<div id="hiddden">
+
+Suppose that an agent is in a $3 \times 3$
+maze environment like the one shown in
+Figure <a href="#">maze-3x3-figure</a>. The agent knows that its
+initial location is (1,1), that the goal is at (3,3), and that the
+actions *Up*, *Down*, *Left*, *Right* have their usual
+effects unless blocked by a wall. The agent does *not* know
+where the internal walls are. In any given state, the agent perceives
+the set of legal actions; it can also tell whether the state is one it
+has visited before.<br />
+
+1.  Explain how this online search problem can be viewed as an offline
+    search in belief-state space, where the initial belief state
+    includes all possible environment configurations. How large is the
+    initial belief state? How large is the space of belief states?<br />
+
+2.  How many distinct percepts are possible in the initial state?<br />
+
+3.  Describe the first few branches of a contingency plan for this
+    problem. How large (roughly) is the complete plan?<br />
+
+Notice that this contingency plan is a solution for *every
+possible environment* fitting the given description. Therefore,
+interleaving of search and execution is not strictly necessary even in
+unknown environments.
+</div>
 
   </div>
   <div class="card">
diff --git a/_site/advanced-search-exercises/ex_3/index.html b/_site/advanced-search-exercises/ex_3/index.html
@@ -164,6 +164,18 @@ <h3 class="masthead-title">
 <script type="text/javascript" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.0/MathJax.js?config=TeX-AMS-MML_HTMLorMML">
 </script>
 
+<div id="hiddden">
+
+In this exercise, we explore the use of local search methods to solve
+TSPs of the type defined in Exercise <a href="#">tsp-mst-exercise</a><br />
+
+1.  Implement and test a hill-climbing method to solve TSPs. Compare the
+    results with optimal solutions obtained from the A* algorithm with
+    the MST heuristic (Exercise <a href="#">tsp-mst-exercise</a>)<br />
+
+2.  Repeat part (a) using a genetic algorithm instead of hill climbing.
+    You may want to consult @Larranaga+al:1999 for some suggestions for representations.
+</div>
 
   </div>
   <div class="card">
diff --git a/_site/complex-decisions-exercises/ex_8/index.html b/_site/complex-decisions-exercises/ex_8/index.html
@@ -164,6 +164,18 @@ <h3 class="masthead-title">
 <script type="text/javascript" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.0/MathJax.js?config=TeX-AMS-MML_HTMLorMML">
 </script>
 
+<div id="hiddden">
+
+Equation (<a href="#">vi-contraction-equation</a>) on
+page <a href="#">vi-contraction-equation</a> states that the Bellman operator is a contraction.<br />
+
+1.  Show that, for any functions $f$ and $g$,
+    $$|\max_a f(a) - \max_a g(a)| \leq \max_a |f(a) - g(a)|\ .$$<br />
+
+2.  Write out an expression for $$|(B\,U_i - B\,U'_i)(s)|$$ and then apply
+    the result from (1) to complete the proof that the Bellman operator
+    is a contraction.<br />
+</div>
 
   </div>
   <div class="card">
diff --git a/_site/intro-exercises/ex_17/index.html b/_site/intro-exercises/ex_17/index.html
@@ -164,9 +164,12 @@ <h3 class="masthead-title">
 <script type="text/javascript" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.0/MathJax.js?config=TeX-AMS-MML_HTMLorMML">
 </script>
 
-<p>“Surely animals, humans, and computers cannot be intelligent—they can do
+<div id="hiddden">
+
+“Surely animals, humans, and computers cannot be intelligent—they can do
 only what their constituent atoms are told to do by the laws of
-physics.” Is the latter statement true, and does it imply the former?</p>
+physics.” Is the latter statement true, and does it imply the former?
+</div>
 
   </div>
   <div class="card">
diff --git a/_site/kr-exercises/ex_22/index.html b/_site/kr-exercises/ex_22/index.html
@@ -164,6 +164,34 @@ <h3 class="masthead-title">
 <script type="text/javascript" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.0/MathJax.js?config=TeX-AMS-MML_HTMLorMML">
 </script>
 
+<div id="hiddden">
+
+(Adapted from @Fagin+al:1995.) Consider a game played
+with a deck of just 8 cards, 4 aces and 4 kings. The three players,
+Alice, Bob, and Carlos, are dealt two cards each. Without looking at
+them, they place the cards on their foreheads so that the other players
+can see them. Then the players take turns either announcing that they
+know what cards are on their own forehead, thereby winning the game, or
+saying “I don’t know.” Everyone knows the players are truthful and are
+perfect at reasoning about beliefs.<br />
+
+1.  Game 1. Alice and Bob have both said “I don’t know.” Carlos sees
+    that Alice has two aces (A-A) and Bob has two kings (K-K). What
+    should Carlos say? (<i>Hint</i>: consider all three possible
+    cases for Carlos: A-A, K-K, A-K.)<br />
+
+2.  Describe each step of Game 1 using the notation of modal logic.<br />
+
+3.  Game 2. Carlos, Alice, and Bob all said “I don’t know” on their
+    first turn. Alice holds K-K and Bob holds A-K. What should Carlos
+    say on his second turn?<br />
+
+4.  Game 3. Alice, Carlos, and Bob all say “I don’t know” on their first
+    turn, as does Alice on her second turn. Alice and Bob both hold A-K.
+    What should Carlos say?<br />
+
+5.  Prove that there will always be a winner to this game.<br />
+</div>
 
   </div>
   <div class="card">
diff --git a/_site/logical-inference-exercises/ex_11/index.html b/_site/logical-inference-exercises/ex_11/index.html
@@ -164,6 +164,27 @@ <h3 class="masthead-title">
 <script type="text/javascript" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.0/MathJax.js?config=TeX-AMS-MML_HTMLorMML">
 </script>
 
+<div id="hiddden">
+
+Suppose you are given the following axioms:<br />
+
+ 1. $0 \leq 3$.<br />
+ 2. $7 \leq 9$.<br />
+ 3. ${\forall\,x\;\;} \; \; x \leq x$.<br />
+ 4. ${\forall\,x\;\;} \; \; x \leq x+0$.<br />
+ 5. ${\forall\,x\;\;} \; \; x+0 \leq x$.<br />
+ 6. ${\forall\,x,y\;\;} \; \; x+y \leq y+x$.<br />
+ 7. ${\forall\,w,x,y,z\;\;} \; \; w \leq y$ $\wedge$ $x \leq z$ ${\:\;{\Rightarrow}\:\;}$ $w+x \leq y+z$.<br />
+ 8. ${\forall\,x,y,z\;\;} \; \; x \leq y \wedge y \leq z \: {\:\;{\Rightarrow}\:\;}\: x \leq z$ <br />
+<br />
+1.  Give a backward-chaining proof of the sentence $7 \leq 3+9$. (Be
+    sure, of course, to use only the axioms given here, not anything
+    else you may know about arithmetic.) Show only the steps that leads
+    to success, not the irrelevant steps.<br />
+
+2.  Give a forward-chaining proof of the sentence $7 \leq 3+9$. Again,
+    show only the steps that lead to success.<br />
+</div>
 
   </div>
   <div class="card">
diff --git a/_site/logical-inference-exercises/ex_13/index.html b/_site/logical-inference-exercises/ex_13/index.html
@@ -164,6 +164,15 @@ <h3 class="masthead-title">
 <script type="text/javascript" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.0/MathJax.js?config=TeX-AMS-MML_HTMLorMML">
 </script>
 
+<div id="hiddden">
+
+A popular children’s riddle is “Brothers and sisters have I none, but
+that man’s father is my father’s son.” Use the rules of the family
+domain (Section <a href="#">kinship-domain-section</a> on
+page <a href="#">kinship-domain-section</a> to show who that man is. You may apply any of the
+inference methods described in this chapter. Why do you think that this
+riddle is difficult?
+</div>
 
   </div>
   <div class="card">
diff --git a/_site/search-exercises/ex_10/index.html b/_site/search-exercises/ex_10/index.html
@@ -164,6 +164,37 @@ <h3 class="masthead-title">
 <script type="text/javascript" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.0/MathJax.js?config=TeX-AMS-MML_HTMLorMML">
 </script>
 
+<div id="hiddden">
+
+On page <a href="#">non-negative-g</a>, we said that we would not consider problems
+with negative path costs. In this exercise, we explore this decision in
+more depth.<br />
+
+1.  Suppose that actions can have arbitrarily large negative costs;
+    explain why this possibility would force any optimal algorithm to
+    explore the entire state space.<br />
+
+2.  Does it help if we insist that step costs must be greater than or
+    equal to some negative constant $c$? Consider both trees and graphs.<br />
+
+3.  Suppose that a set of actions forms a loop in the state space such
+    that executing the set in some order results in no net change to
+    the state. If all of these actions have negative cost, what does
+    this imply about the optimal behavior for an agent in such an
+    environment?<br />
+
+4.  One can easily imagine actions with high negative cost, even in
+    domains such as route finding. For example, some stretches of road
+    might have such beautiful scenery as to far outweigh the normal
+    costs in terms of time and fuel. Explain, in precise terms, within
+    the context of state-space search, why humans do not drive around
+    scenic loops indefinitely, and explain how to define the state space
+    and actions for route finding so that artificial agents can also
+    avoid looping.<br />
+
+5.  Can you think of a real domain in which step costs are such as to
+    cause looping?<br />
+</div>
 
   </div>
   <div class="card">
diff --git a/_site/search-exercises/ex_4/index.html b/_site/search-exercises/ex_4/index.html
@@ -8,7 +8,7 @@
   <meta name="viewport" content="width=device-width, initial-scale=1.0, maximum-scale=1">
   <title>
     
-      Exercise 3.5 &middot; AIMA Exercises 
+      Exercise 3.4 &middot; AIMA Exercises 
     
   </title>
   <!-- CSS -->
@@ -164,45 +164,76 @@ <h3 class="masthead-title">
 <script type="text/javascript" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.0/MathJax.js?config=TeX-AMS-MML_HTMLorMML">
 </script>
 
+<div id="hiddden">
+
+You have a $9 \times 9$ grid of squares, each of which can be colored
+red or blue. The grid is initially colored all blue, but you can change
+the color of any square any number of times. Imagining the grid divided
+into nine $3 \times 3$ sub-squares, you want each sub-square to be all
+one color but neighboring sub-squares to be different colors.<br />
+
+1.  Formulate this problem in the straightforward way. Compute the size
+    of the state space.<br />
+
+2.  You need color a square only once. Reformulate, and compute the size
+    of the state space. Would breadth-first graph search perform faster
+    on this problem than on the one in (a)? How about iterative
+    deepening tree search?<br />
+
+3.  Given the goal, we need consider only colorings where each
+    sub-square is uniformly colored. Reformulate the problem and compute
+    the size of the state space.<br />
+
+4.  How many solutions does this problem have?<br />
+
+5.  Parts (b) and (c) successively abstracted the original problem (a).
+    Can you give a translation from solutions in problem (c) into
+    solutions in problem (b), and from solutions in problem (b) into
+    solutions for problem (a)?<br />
+</div>
 
   </div>
   <div class="card">
     <div class="card-header p-2">
-        <a href='#' class="p-2">Exercise 3.5</a>
+        <a href='#' class="p-2">Exercise 3.4</a>
         <a class="solve_question" id="solve_question" href="#">
         <button type="button" class="btn btn-dark float-right" title="Solve this Exercise" href="#" id="buttonsolve">
-        <i id="ch3ex5" class="fas fa-pen" style="color:white"></i>
+        <i id="ch3ex4" class="fas fa-pen" style="color:white"></i>
         </button>
         </a>
         <a class="edit_question" id="editt_question" href="#">
-        <button type="button" class="btn btn-dark float-right" title="Edit this Question" style="margin-left:10px; margin-right:10px;" onclick="edit('ch3ex5');" href="#" id="buttonsolve">
-        <i id="ch3ex5" class="far fa-edit" style="color:white"></i>
+        <button type="button" class="btn btn-dark float-right" title="Edit this Question" style="margin-left:10px; margin-right:10px;" onclick="edit('ch3ex4');" href="#" id="buttonsolve">
+        <i id="ch3ex4" class="far fa-edit" style="color:white"></i>
         </button>
         </a>
     </div>
     <div class="card-body">
         <p class="card-text">
 
-Suppose two friends live in different cities on
-a map, such as the Romania map shown in . On every turn, we can
-simultaneously move each friend to a neighboring city on the map. The
-amount of time needed to move from city $i$ to neighbor $j$ is equal to
-the road distance $d(i,j)$ between the cities, but on each turn the
-friend that arrives first must wait until the other one arrives (and
-calls the first on his/her cell phone) before the next turn can begin.
-We want the two friends to meet as quickly as possible.<br>
+You have a $9 \times 9$ grid of squares, each of which can be colored
+red or blue. The grid is initially colored all blue, but you can change
+the color of any square any number of times. Imagining the grid divided
+into nine $3 \times 3$ sub-squares, you want each sub-square to be all
+one color but neighboring sub-squares to be different colors.<br>
+
+1.  Formulate this problem in the straightforward way. Compute the size
+    of the state space.<br>
 
-1.  Write a detailed formulation for this search problem. (You will find
-    it helpful to define some formal notation here.)<br>
+2.  You need color a square only once. Reformulate, and compute the size
+    of the state space. Would breadth-first graph search perform faster
+    on this problem than on the one in (a)? How about iterative
+    deepening tree search?<br>
 
-2.  Let $D(i,j)$ be the straight-line distance between cities $i$ and
-    $j$. Which of the following heuristic functions are admissible? (i)
-    $D(i,j)$; (ii) $2\cdot D(i,j)$; (iii) $D(i,j)/2$. <br>
+3.  Given the goal, we need consider only colorings where each
+    sub-square is uniformly colored. Reformulate the problem and compute
+    the size of the state space.<br>
 
-3.  Are there completely connected maps for which no solution exists? <br>
+4.  How many solutions does this problem have?<br>
 
-4.  Are there maps in which all solutions require one friend to visit
-    the same city twice?
+5.  Parts (b) and (c) successively abstracted the original problem (a).
+    Can you give a translation from solutions in problem (c) into
+    solutions in problem (b), and from solutions in problem (b) into
+    solutions for problem (a)?<br>
 </p>
     </div>
 </div>
@@ -254,7 +285,7 @@ <h3 class="masthead-title">
 <br><br>
 <div id="writeeanswer"></div>
 <div class="styling" id="styling2">
-<form class="contact100-form validate-form" id="new_comment" method="post" action="https://staticmanlove.herokuapp.com/v3/entry/github/aimacode/aima-exercises/master/ch3ex5">
+<form class="contact100-form validate-form" id="new_comment" method="post" action="https://staticmanlove.herokuapp.com/v3/entry/github/aimacode/aima-exercises/master/ch3ex4">
     <span class="contact100-form-title">
         <center>Submit Solution</center>
     </span>
@@ -291,7 +322,7 @@ <h3 class="masthead-title">
 <script>
 var baseurl="https://github.com/aimacode/aima-exercises/edit/master/markdown/";
   var chapterName = String('3-Solving-Problems-By-Searching');
-  var fullName = String('ch3ex5');
+  var fullName = String('ch3ex4');
   var dot = fullName.indexOf("x");
   var exerciseName = "ex_";
   var subs = fullName.substring(dot+1,fullName.length);
diff --git a/_site/search_data.json b/_site/search_data.json
