14 Jan 2004
CS 3243 - Blind Search
12
Selecting a state space
nReal world is absurdly complex
à state space must be abstracted
for problem solving
n(Abstract) state = set of real states
n(Abstract) action = complex combination of real
actions
ne.g., "Arad à
Zerind" represents a complex set of possible routes, detours, rest stops, etc.
nFor guaranteed realizability, any real state "in Arad“ must get to some real state "in Zerind"
n(Abstract) solution =
nset of real paths that are solutions in the real
world
nEach abstract action should be "easier" than
the original problem