CS188 Constraint Satisfaction Problems

Constraint Satisfaction Problems

Identification Problem: problems in which we must simply identify whether a state is a goal state or not, with no regard to how we arrive at that goal.

1. Variables

2. Domain

3. Constraints
   - Unary
   - Binary
   - Higher-order

Backtracking Search

CSPs -> Search Problem by partial assignments

Filtering

• Forward Checking -> arc consistency -> AC-3 Algorithm

  K-consistency

  Strong k-consistency

Ordering

• Minimum Remaining Values

• Least Constraining Value

Structure

Tree Structure

$O(d^N)$ -> $O(n{d}^2)$

1. Forming a tree structure

   cutset conditioning

2. Perform a backwards pass of arc consistency

3. Perform a forward assignment

Local Search

both incomplete and suboptimal

min-conflicts heuristic

• Hill-Climbing Search

• Random-restart Hill-Climbing Search

• Simulated Annealing Search

• Genetic Algorithm