{ "cells": [ { "cell_type": "markdown", "metadata": {}, "source": [ "# Artificial Intelligence UE\n", "## Exercises 1 - Uninformed Search\n", "\n", "In this series of exercises you can implement a few different **uninformed** search algorithms: \n", "- Breadth First Search\n", "- Uniform Cost Search\n", "- Depth First Search\n", "- Depth Limited Depth First Search\n", "- Iterative Deepening Search\n", "\n", "The algorithms have been explained in the lecture (VO) and we gave you some additional information in the exercise (UE). Please refer to the lecture slides (VO) for the pseudo algorithms and the exercise slides (UE) for additional hints. \n", "Before implementing the algorithms make sure to check out the introductory notebook \"introducing_pig.ipynb\" and read the following instructions carefully.\n", "\n", "
Practical hints:
\n", "# YOUR CODE HERE, raise NotImplementedError() with your code.solve() should return the found solution node or None if no solution is found. You do not need to store the path, the function node.get_action_sequence() can be used to retrieve it later via backtracking.set() to store already visited nodes (when needed).Queue, Stack, and PriorityQueue as the fringe / frontier (choose the right datatype depending on the algorithm)# YOUR CODE HERE!\n",
"