This page is located in archive.

04 Search II

How to speed up and go towards the goal more efficiently. Heuristic functions. Which are admissible, better?


How to throw eggs from floors in order to optimize the number of trials.

Search programming

  • Python queue or heapq are helpful for saving the nodes from a tree.
courses/be5b33kui/labs/weekly/week_04.txt ยท Last modified: 2018/05/21 12:58 by svarnpet