Search.ipynb (aimacode#1167)

* Update search.ipynb

* Update search.ipynb

Author: So-ham

search.ipynb

@@ -2853,6 +2853,7 @@
     "        neighbor = argmax_random_tie(neighbors,\n",
     "                                     key=lambda node: problem.value(node.state))\n",
     "        if problem.value(neighbor.state) <= problem.value(current.state):\n",
+    "        \"\"\"Note that it is based on negative path cost method\"\"\"\n",    
     "            current.state = neighbor.state\n",
     "        iterations -= 1\n",
     "        \n",