Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.


Artificial Intelligence

NPTEL and Indian Institute of Technology Madras via YouTube


Instructor: Prof. Deepak Khemani, Department of Computer Science and Engineering, IIT Madras.

This course provides an introduction to artificial intelligence. Topics include Introduction: Overview and Historical Perspective, Turing test, Physical Symbol Systems and the scope of Symbolic AI, Agents; State Space Search: Depth First Search, Breadth-First Search, DFID; Heuristic Search: Best First Search, Hill Climbing, Beam Search, Tabu Search; Randomized Search: Simulated Annealing, Genetic Algorithms, Ant Colony Optimization; Finding Optimal Paths: Branch and Bound, A*, IDA*, Divide and Conquer approaches, Beam Stack Search; Problem Decomposition: Goal Trees, AO*, Rule-Based Systems, Rete Net; Game Playing: Minimax Algorithm, Alpha-Beta Algorithm, SSS*; Planning and Constraint Satisfaction: Domains, Forward and Backward Search, Goal Stack Planning, Plan Space Planning, Graphplan, Constraint Propagation; Logic and Inferences: Propositional Logic, First Order Logic, Soundness and Completeness, Forward and Backward chaining.


Artificial Intelligence: Introduction.
Introduction to AI.
AI Introduction: Philosophy.
AI Introduction.
Introduction: Philosophy.
State Space Search - Introduction.
Search - DFS and BFS.
Search DFID.
Heuristic Search.
Hill climbing.
Solution Space Search,Beam Search.
TSP Greedy Methods.
Tabu Search.
Optimization - I (Simulated Annealing).
Optimization II (Genetic Algorithms).
Population based methods for Optimization.
Population Based Methods II.
Branch and Bound, Dijkstra's Algorithm.
A* Algorithm.
Admissibility of A*.
A* Monotone Property, Iterative Deeping A*.
Recursive Best First Search, Sequence Allignment.
Pruning the Open and Closed lists.
Problem Decomposition with Goal Trees.
AO* Algorithm.
Game Playing.
Game Playing- Minimax Search.
Game Playing - AlphaBeta.
Game Playing-SSS *.
Rule Based Systems.
Inference Engines.
Rete Algorithm.
Planning FSSP, BSSP.
Goal Stack Planning Sussman's Anomaly.
Non-linear planning.
Plan Space Planning.
Mod-01 Lec-39 Constraint Satisfaction Problems.
Mod-01 Lec-40 CSP Continued.
Mod-01 Lec-41 Knowlege Based Systems.
Mod-01 Lec-42 Knowledge Based Systems PL.
Mod-01 Lec-43 Propositional Logic.
Mod-01 Lec- 44 Resolution Refutation for PL.
Mod-01 Lec-45 First Order Logic (FOL).
Mod-01 Lec-46 Reasoning in FOL.
Mod-01 Lec-47 Backward Chaining.
Mod-01 Lec-48 Resolution for FOL.

Taught by




Start your review of Artificial Intelligence

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.