{ "cells": [ { "cell_type": "markdown", "metadata": { "deletable": false, "editable": false, "nbgrader": { "cell_type": "markdown", "checksum": "57e5ba00b7b45ec500d2f43583946ec4", "grade": false, "grade_id": "cell-fca4677f5235e400", "locked": true, "schema_version": 3, "solution": false, "task": false }, "slideshow": { "slide_type": "" }, "tags": [] }, "source": [ "# Artificial Intelligence UE\n", "## Exercises 2 - Heuristic Search\n", "\n", "In this exercise you will implement two heuristic search algorithms: Greedy Best First Search and A* search. We also look at a few different heuristics to test out the algorithms. \n", "\n", "The algorithms have been explained in the lecture (VO) and we provide some additional hints for the different heuristics below. Please refer to the lecture slides (VO) for the pseudo algorithms.\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.-1 for now; change them so that they return the distance that they represent!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",
"