COMPSCI 171 Quiz: 2012-fq-cs-171-quiz-1-key
Document Summary
Cs-171, intro to a. i. , fall quarter, 2012 quiz # 1 20 minutes: name: From right: (16 pts total, 4 pts each) your book defines a task environment as a set of four things, with the acronym peas. Fill in the blanks with the names of the peas components. Sensors: (24 pts total, 4 pts each) label the following statements as true (t) or false (f). T local search algorithms generally operate only on one (or a few) current node(s). F local search algorithms generally are used to find the globally optimal solution. T in tabu search recently visited states are temporarily excluded from being visited again. F simulated annealing is more likely to accept a bad move late in the search than earlier. T local beam search retains the k best successors of the k states in the previous step.
