Online Search

CSC 261 - Weinman

Answer the following questions. Record your answers in your Reading Journal.

1. The book asserts that "no single algorithm can avoid dead ends in all state spaces" (p. 124) because it must make the same decision when the state spaces are indistinguishable. Give an example from your own experience where a multiplicity of "state spaces" existed that looked identical.
2. The sub-section Online search problems states that "we will assume that the actions are deterministic." (p. 123) Select one sentence from the reading that best illustrates a reliance on this assumption. Briefly explain why you chose this sentence.
3. Frame the basic idea for using memory in local search in your own words.

---

File translated from T_EX by T_TH, version 3.80.
On 11 Sep 2009, 16:29.