week--5 & 6

  1. Constraint Satisfaction Problems: A constraint satisfaction problem (CSP) is a problem that requires its solution to be within some limitations/conditions also known as constraints consisting of a finite variable set, a domain set and a finite constraint set. Some of the popular CSP problems include Sudoku, CryptArithmetic, Crosswords, n-Queen, etc.
  2. Minimax Algorithm, Alpha-Beta Pruning: used for solving 2 player game problems

Download Files

ai.pdf (0.75 MB )