24 Mar 2004
CS 3243 - Revision
24
Constraint Satisfaction
ˇDiscrete
or continuous solutions
lDiscretize and limit possible values
ˇModeled
as a constraint graph
ˇAs
the path to the solution doesn’t matter, local search
can be very useful.