Added answer to chapter 3 questions.

U-HOMEOFFICE\adanie8 · U-HOMEOFFICE\adanie8 · commit 055379bec331 · 2017-01-11T06:04:47.000-08:00
diff --git a/adxyz_agents_chap2.ipynb b/adxyz_agents_chap2.ipynb
@@ -1389,6 +1389,8 @@
     "\n",
     "C) Are there completely connected maps that have no solution? \n",
     "\n",
+    "One possible case is a map consisting of two nodes that are connected.  If the search algorithm doesn't take this into account, then the friends could swap cities, and then no longer be able to either swap back (since the state has been visited) and cannot meet.\n",
+    "\n",
     "D) Are there maps in which all solutions require one friend to visit the same city twice? "
    ]
   },

Original file line number	Diff line number	Diff line change
`@@ -1389,6 +1389,8 @@`
`1389`	`1389`	`"\n",`
`1390`	`1390`	`"C) Are there completely connected maps that have no solution? \n",`
`1391`	`1391`	`"\n",`
	`1392`	`+ "One possible case is a map consisting of two nodes that are connected. If the search algorithm doesn't take this into account, then the friends could swap cities, and then no longer be able to either swap back (since the state has been visited) and cannot meet.\n",`
	`1393`	`+ "\n",`
`1392`	`1394`	`"D) Are there maps in which all solutions require one friend to visit the same city twice? "`
`1393`	`1395`	`]`
`1394`	`1396`	`},`