-
Lab-1
This lab includes implementation of Breadth First Search (BFS), Depth First Search (DFS), and Depth First Iterative Deepening (DFID). -
Lab-2
This lab includes implementation of Block World Problem using Best First Search (BFS) and Hill Climbing Algorithms. -
Lab-3
This lab includes implementation of k-SAT Problem using Heuristic Search Algorithms like VND and Tabu Search. -
Lab-4
This lab includes implementation of Travelling Salesman Problem (TSP) using any of above mentioned algorithms to get minimum possible costs. -
Lab-5
This lab includes implementation of Othello Game using MiniMax and Alpha-Beta Pruning Algorithms. -
Lab-6
This lab includes implementation of Spam Email Classification using Support Vector Machines. -
Lab-7
This lab includes implementation of Grid World Problem using techniques of Value Iteration and Policy Iteration in Reinforcement Learning to get optimal cost.
asishgokarakonda / cs312-ai-lab Goto Github PK
View Code? Open in Web Editor NEWThis project forked from rishitsaiya/cs312-ai-lab
Artificial Intelligence Lab Course (CS 312), IIT Dharwad
License: MIT License