Online Search

CSC 261 - Artificial Intelligence - Weinman



Answer the following questions. Record your answers in your Reading Journal.
  1. The book asserts that "no algorithm can avoid dead ends in all state spaces" (p. 149, top) because it must make the same decision when the state spaces are indistinguishable. Describe an example from your own experience where a multiplicity of identical-looking "state spaces" were possible. (Note this problem is distinct from state aliasing-it is state space aliasing.)
  2. The section 4.5.1 states "We will assume a deterministic ... environment" (p. 147, middle). Identify one sentence from the reading that you feel best exemplifies a reliance on this assumption. Briefly (3-5 sentences) explain why you chose this sentence.
  3. Frame the basic idea for using memory in local search in your own words.