Assignments done as part of the course 318- Artificial Intelligence
BFS and DFS to solve "Missionaries and Cannibal" Problem
A* Search to solve "N puzzle game" with 3 different Heuristics
Local Search to solve "Travelling Salesman Problem" Using 5 Different Approaches:
1. Nearest Neighbour
2. Nearest Insertion
3. Cheapest Insertion
1. 2-Opt Heuristics
2. 3-opt Heuristics
Implementing MiniMax algorithm with Alpha-Beta Pruning And Testing with Iterative Deepening Depth First Search (IDDFS) with various Heuristics and play games between different agents
Game: Kalah (A variation of Mancala)