Modules Roadmap About Start Here

Introduction to Artificial Intelligence

From intelligent agents to the A* algorithm — the foundations of AI, taught by example.

Based on Russell & Norvig, Artificial Intelligence: A Modern Approach (4th ed.). University course 606360.

7
Modules
A*
Capstone Algorithm
$0
Cost

Course Modules

One concept per module, building from what intelligence is up to the most famous search algorithm in AI. Each module is a written tutorial with worked examples, algorithm traces, and an exercise with solutions.

01
What is AI?
Definitions, the Turing Test, and the four approaches to AI.
Available now
02
History & Foundations
From McCulloch-Pitts neurons to the deep learning revolution.
Available now
03
Intelligent Agents
Agents, PEAS, environments, and the five agent types.
Available now
04
Problem Solving by Search
Formulating problems, state spaces, and search trees.
Available now
05
Uninformed (Blind) Search
BFS, DFS, depth-limited, iterative deepening, uniform cost.
Available now
06
Informed Search & A*
Heuristics, greedy best-first, and the A* algorithm.
Available now
07
Adversarial Search & Games
Minimax, evaluation functions, and alpha-beta pruning.
Available now

Coming Soon

The full syllabus continues beyond search. These modules are on the way — they follow the same textbook and format.

08
Knowledge Representation
Semantic networks, frames, and rule-based systems.
Coming soon
09
Logic & Inference
Propositional and predicate logic, resolution.
Coming soon
10
Expert Systems
Rule-based systems, forward & backward chaining.
Coming soon
11
Machine Learning
Supervised, unsupervised, and reinforcement learning.
Coming soon
12
Neural Networks
Perceptrons, backpropagation, and deep learning.
Coming soon

About This Course

This is the search unit of an Introduction to Artificial Intelligence course (No. 606360), built directly from the lecture material and the standard textbook, Russell & Norvig, Artificial Intelligence: A Modern Approach (4th edition). Every module follows the same rhythm: learn the concept in plain English, walk a worked example or algorithm trace, then test yourself with an exercise and its solution. We start from the very definition of intelligence and finish with a full, hand-traced run of the A* algorithm on the classic Romania route-finding problem — the payoff of everything that comes before it.