Constraint Satisfaction Problems
CSP: variables, domains, constraints. Sudoku, map colouring, timetables. Solve by search + constraint propagation (arc consistency). 8-queens is the textbook CSP: one queen per row, no shared column/diagonal.
Don’t start with genetic algorithms. First: variables + domains + constraints, then backtracking.
Constraint Satisfaction Problems — output: A= R B= G and A= G B= R. Neighbours differ. Sudoku is the same idea bigger.
data → train / test
│
▼
model
│
▼
predictDefine CSP + one example.