This repository presents implementations of four classical problems based on the concept of Constraint Satisfaction Problems (CSP) in Artificial Intelligence.
- Australia Map Coloring
- Telangana District Map Coloring
- Sudoku Solver
- Cryptarithmetic Puzzle (TWO + TWO = FOUR)
All problems are solved using a backtracking approach, ensuring that constraints are satisfied at every step.
A Constraint Satisfaction Problem consists of:
- Variables: Elements that need values
- Domain: Possible values for each variable
- Constraints: Conditions that must be satisfied
The aim is to assign values to all variables without violating any constraint.
- Backtracking Search
- Constraint Checking before assignment
- Recursive exploration of possibilities
CSP techniques are widely used in:
- Scheduling systems
- Puzzle solving
- Resource allocation
- AI planning problems
This assignment demonstrates how CSP techniques can be applied to solve structured problems efficiently using logical constraints and systematic search.