Clarifications Help Center
Errors in course materials are also noted on this Errata page.
Video 1.1
Video 1.2
- gamma function: why a set of states as a result
- successor function of a search problem is actually a function
- what does the epsilon really mean?
- what does the epsilon really mean?
- missionaries and cannibals problem
- quiz: dynamic planning
- nodes and states for missionaries and cannibals problem
- conceptual model for planning last quiz
Video 1.3
video 1.4
video 1.7
Video 2.2
- A* tree search
- infinite loop of general tree search algorithm
- path reconstruction in A* (best-first) search
- quiz: salue of f(s)
Video 2.4
- tree search vs. graph search?
- tree search vs. graph search
- graph search with a 2-dimensional grid search space
- graph search returns longer path?
Video 2.7
- algorithm for finding applicable actions
- validating substitutions
- operators with little/no positive preconditions
Video 2.8
Video 3.3
Exam Questions
- A* tree search Oradea to Bucharest
- goal state has only one ground atom
- assume a limited set of objects?
- limited set of objects
Programming Assignments
- programming background
- which programming language
- programming language(s) for assignments
- Java framework to try writing algorithms?
- Javascript, PHP planning library or framework suggestions
- Prolog in use any more
- Python libraries and editor for this course
- Python programmers tips and tricks
- missionaries and cannibals problem in Python
- missionaries and cannibals: hard code all possible actions for every state?
- data for touring Romania problem
- Eight puzzle heuristic is giving different paths length
- node depth, plan length and number of steps
- way too long...
- difference between Q1 and Q2?
- keep track of visited nodes
- optimal path with graph search for a random puzzle
- backward search
- backward search
Creative Challenge
Created Mon 9 Feb 2015 5:19 PM CET
Last Modified Mon 2 Mar 2015 1:13 PM CET
Last Modified Mon 2 Mar 2015 1:13 PM CET