Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Fixed visualization of Iterative Deepening search. #4

Open
wants to merge 2 commits into
base: main
Choose a base branch
from
Open

Fixed visualization of Iterative Deepening search. #4

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
76066e8
Fixed visualization of Iterative Deepening search; previously, only t…
mairbasti Nov 6, 2023
73d4a2e
Cleared notebook.
mairbasti Nov 6, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
65 changes: 41 additions & 24 deletions UninformedSearch.ipynb
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -22,7 +22,9 @@
{
"cell_type": "code",
"execution_count": null,
"metadata": {},
"metadata": {
"tags": []
},
"outputs": [],
"source": [
"from search import *\n",
Expand Down Expand Up @@ -60,7 +62,9 @@
{
"cell_type": "code",
"execution_count": null,
"metadata": {},
"metadata": {
"tags": []
},
"outputs": [],
"source": [
"%matplotlib inline\n",
Expand All @@ -84,7 +88,9 @@
{
"cell_type": "code",
"execution_count": null,
"metadata": {},
"metadata": {
"tags": []
},
"outputs": [],
"source": [
"simple_tree = UndirectedGraph(dict(\n",
Expand Down Expand Up @@ -112,7 +118,9 @@
{
"cell_type": "code",
"execution_count": null,
"metadata": {},
"metadata": {
"tags": []
},
"outputs": [],
"source": [
"simple_tree_locations = simple_tree.locations\n",
Expand All @@ -131,7 +139,9 @@
{
"cell_type": "code",
"execution_count": null,
"metadata": {},
"metadata": {
"tags": []
},
"outputs": [],
"source": [
"from search_helpers import show_tree, display_steps"
Expand All @@ -147,7 +157,9 @@
{
"cell_type": "code",
"execution_count": null,
"metadata": {},
"metadata": {
"tags": []
},
"outputs": [],
"source": [
"# node colors, node positions and node label positions\n",
Expand All @@ -167,7 +179,9 @@
{
"cell_type": "code",
"execution_count": null,
"metadata": {},
"metadata": {
"tags": []
},
"outputs": [],
"source": [
"show_tree(simple_tree_data)"
Expand Down Expand Up @@ -215,7 +229,9 @@
{
"cell_type": "code",
"execution_count": null,
"metadata": {},
"metadata": {
"tags": []
},
"outputs": [],
"source": [
"def breadth_first_search_graph_vis(problem):\n",
Expand Down Expand Up @@ -293,7 +309,9 @@
{
"cell_type": "code",
"execution_count": null,
"metadata": {},
"metadata": {
"tags": []
},
"outputs": [],
"source": [
"all_node_colors = []\n",
Expand Down Expand Up @@ -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",
Expand All @@ -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",
Expand All @@ -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",
Expand Down Expand Up @@ -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)"
]
},
{
Expand Down Expand Up @@ -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
}