Unit: Search Agents
Lesson: Constraint Satisfaction Problems (CSPs)
Solving Puzzles with AI
How Do Computers Solve CSPs?
CSP Notebook (Optional)
CSPs Quiz
Variables, solutions, and algorithms
Variables, domain, and constraints
Domain, constraints, and backtracking
Variables, search space, and heuristics
They are on opposite sides of the map
They are neighboring states
The article specifies they must have different colors
There aren't enough colors in the domain
CSPs are always easier to solve
CSPs only work with geographic problems
CSPs focus on the final state rather than the sequence of actions
CSPs cannot be solved by computers
Going back to the beginning and starting over
Trying all possible solutions at once
Drawing the constraint graph backwards
Undoing recent assignments when reaching a dead end and trying different values