COMPSCI 188 Study Guide - Final Guide: Variable Elimination, Conditional Independence, Search Algorithm
Document Summary
The exam is open-book, open-notes, no electronics other than calculators. Write your name, sid, login, and section number at the top of each page. If you are not sure of your answer you may wish to provide a brief explanation. All short answer sections can be successfully answered in a few sentences at most. Consider the following generic search problem formulation with nitely many states: States: there are d + 2 states: {ss, sg} {s1, . Successor function: succ(s) generates at most b successors. Goal test: sg is the only goal state. Speci cally, assume we can only store k states during search. Either argue why not, or give a method along with an improved bound on n. If we knew the exact value of n, we could formulate a csp whose complete assignment speci es an optimal solution path (x0, x1 . State binary and unary constraints which guarantee that a statisfying assignment is a valid solution.
