diff --git a/UninformedSearch.ipynb b/UninformedSearch.ipynb
index 33f363f13..e960765fd 100644
--- a/UninformedSearch.ipynb
+++ b/UninformedSearch.ipynb
@@ -22,7 +22,9 @@
   {
    "cell_type": "code",
    "execution_count": null,
-   "metadata": {},
+   "metadata": {
+    "tags": []
+   },
    "outputs": [],
    "source": [
     "from search import *\n",
@@ -60,7 +62,9 @@
   {
    "cell_type": "code",
    "execution_count": null,
-   "metadata": {},
+   "metadata": {
+    "tags": []
+   },
    "outputs": [],
    "source": [
     "%matplotlib inline\n",
@@ -84,7 +88,9 @@
   {
    "cell_type": "code",
    "execution_count": null,
-   "metadata": {},
+   "metadata": {
+    "tags": []
+   },
    "outputs": [],
    "source": [
     "simple_tree = UndirectedGraph(dict(\n",
@@ -112,7 +118,9 @@
   {
    "cell_type": "code",
    "execution_count": null,
-   "metadata": {},
+   "metadata": {
+    "tags": []
+   },
    "outputs": [],
    "source": [
     "simple_tree_locations = simple_tree.locations\n",
@@ -131,7 +139,9 @@
   {
    "cell_type": "code",
    "execution_count": null,
-   "metadata": {},
+   "metadata": {
+    "tags": []
+   },
    "outputs": [],
    "source": [
     "from search_helpers import show_tree, display_steps"
@@ -147,7 +157,9 @@
   {
    "cell_type": "code",
    "execution_count": null,
-   "metadata": {},
+   "metadata": {
+    "tags": []
+   },
    "outputs": [],
    "source": [
     "# node colors, node positions and node label positions\n",
@@ -167,7 +179,9 @@
   {
    "cell_type": "code",
    "execution_count": null,
-   "metadata": {},
+   "metadata": {
+    "tags": []
+   },
    "outputs": [],
    "source": [
     "show_tree(simple_tree_data)"
@@ -215,7 +229,9 @@
   {
    "cell_type": "code",
    "execution_count": null,
-   "metadata": {},
+   "metadata": {
+    "tags": []
+   },
    "outputs": [],
    "source": [
     "def breadth_first_search_graph_vis(problem):\n",
@@ -293,7 +309,9 @@
   {
    "cell_type": "code",
    "execution_count": null,
-   "metadata": {},
+   "metadata": {
+    "tags": []
+   },
    "outputs": [],
    "source": [
     "all_node_colors = []\n",
@@ -784,7 +802,7 @@
     "            node_colors[node.state] = \"gray\"\n",
     "            iterations += 1\n",
     "            all_node_colors.append(dict(node_colors))\n",
-    "            return 'cutoff'\n",
+    "            return (iterations, all_node_colors, 'cutoff')\n",
     "            \n",
     "        else:\n",
     "            cutoff_occurred = False\n",
@@ -799,17 +817,16 @@
     "                node_colors[child.state] = \"orange\"\n",
     "                all_node_colors.append(dict(node_colors))\n",
     "                result = recursive_dls(child, problem, limit - 1, iterations, all_node_colors, node_colors)\n",
-    "                if result == 'cutoff':\n",
+    "                if result[2] == 'cutoff':\n",
     "                    cutoff_occurred = True\n",
-    "                elif result is not None:\n",
+    "                elif result[2] is not None:\n",
     "                    return result\n",
     "            if cutoff_occurred:\n",
     "                node_colors[node.state] = \"gray\"\n",
     "                iterations += 1\n",
     "                all_node_colors.append(dict(node_colors))\n",
     "                \n",
-    "            \n",
-    "            return 'cutoff' if cutoff_occurred else None\n",
+    "            return (iterations, all_node_colors, 'cutoff') if cutoff_occurred else (iterations, all_node_colors, None)\n",
     "        \n",
     "\n",
     "    # Body of depth_limited_search:\n",
@@ -829,7 +846,7 @@
     "    \"\"\"Search the deepest nodes in the search tree first.\"\"\"\n",
     "\n",
     "    result = depth_limited_search_for_vis(problem, limit=limit)\n",
-    "    if result == 'cutoff':\n",
+    "    if result[2] == 'cutoff':\n",
     "        print(\"Due to the limit=%d, the goal state cannot be reached\" % limit)\n",
     "        all_node_colors = []\n",
     "        node_colors = {k : 'white' for k in problem.graph.nodes()}\n",
@@ -871,17 +888,17 @@
    "outputs": [],
    "source": [
     "def iterative_deepening_search_for_vis(problem):\n",
+    "    all_node_colors = []\n",
     "    for depth in range(sys.maxsize):\n",
-    "        result = depth_limited_search_for_vis(problem, limit=depth)\n",
-    "        if result == 'cutoff':\n",
+    "        iterations, new_all_node_colors, res = depth_limited_search_for_vis(problem, limit=depth)\n",
+    "        all_node_colors += new_all_node_colors;\n",
+    "        \n",
+    "        if res == 'cutoff':\n",
     "            print(\"Due to limit=%d, the goal state cannot be reached\" % depth)\n",
     "            continue\n",
     "        else:\n",
-    "            iterations, all_node_colors, node = depth_limited_search_for_vis(problem, limit=depth)\n",
-    "            return(iterations, all_node_colors, node) \n",
-    "        \n",
-    "        if iterations:\n",
-    "            return (iterations, all_node_colors, node)"
+    "            return(iterations, all_node_colors, res)\n",
+    "    return(iterations, all_node_colors, res)"
    ]
   },
   {
@@ -932,9 +949,9 @@
    "name": "python",
    "nbconvert_exporter": "python",
    "pygments_lexer": "ipython3",
-   "version": "3.7.9"
+   "version": "3.7.12"
   }
  },
  "nbformat": 4,
- "nbformat_minor": 2
+ "nbformat_minor": 4
 }