Path Finding on a chessboard using Breadth-First Search (BFS), Depth-First Search (DFS), Uniform-Cost Search (UCS) and A* Search (A*).

    Solving N-Queens Puzzle variation with all chess pieces using Local Search and Constraint Satisfaction Problem (CSP).

      Winning against various Chess AI using Minimax with Alpha-Beta pruning.

•   Module  CS3243 Introduction to Artificial Intelligence
• Concepts A* Search, Constraint Satisfaction Problem, Minimax,
                     Alpha-Beta Pruning
• LanguagePython
•    Github   CS3243 Chess AI Projects