Artificial Intelligence Course Assignments

1. N-Puzzle Solver (A* Search)

• Applied Hamming distance and Manhattan distance heuristics
  • Problem Statement
  • Codes

2. Latin Square Solver (Constraint Satisfaction Problem)

• Implemented Simple backtracking and forward-checking solvers with different variable ordering and value ordering heuristics
  • Problem Statement
  • Codes

3. Exam Scheduling Solver (Local Search)

• Implemented various constructive (DSatur algorithm, largest degree, random ordering) and perturbative heuristics (Kempe-chain interchange, Pair-swap operator)
  • Problem Statement
  • Report
  • Codes

4. Minesweeper Solver (Knowledge Representation and Engineering)

• Implemented random and safe moves based on discarding diagonal neighbor cells
  • Problem Statement
  • Code