14 Jan 2004
CS 3243 - Blind Search
11
Single-state
problem formulation
A problem is
defined by four items:
1.initial
state e.g., "at Arad"
2.actions or successor
function S(x) = set of action–state
pairs
ne.g., S(Arad) = {<Arad à Zerind, Zerind>, … }
3.goal test, can be
nexplicit, e.g., x = "at
Bucharest"
nimplicit, e.g., Checkmate(x)
4.path cost (additive)
ne.g., sum of
distances, number of actions executed, etc.
nc(x,a,y) is the step cost, assumed to be
≥ 0
nA solution is
a sequence of actions leading from the initial state to a goal state