17 Feb 2005
CS 3243 - Constraint Satisfaction
44
Example: 4-Queens
nStates: 4 queens in 4 columns (44 = 256 states)
nActions: move queen in column
nGoal test: no attacks
nEvaluation: h(n) = number of attacks
n
n
n
n
n
nGiven random initial state, can solve n-queens in almost constant time for arbitrary n with high probability (e.g., n = 10,000,000)