SE444: Artificial Intelligence

Comprehensive Course on AI Fundamentals and Advanced Techniques

Interactive lectures, hands-on programming, and real-world applications

About This Course

SE444 is a comprehensive artificial intelligence course covering fundamental concepts, algorithms, and practical applications. Each lecture includes interactive demonstrations, step-by-step explanations, and hands-on programming exercises to reinforce learning.

15+ Interactive Lectures
50+ Code Examples
30+ Visualizations
100% Interactive
Duration: Full Semester
Target: Computer Science Students
Level: Undergraduate/Graduate

Course Lectures

Lecture 3: Search Algorithms

Comprehensive coverage of search algorithms including BFS, DFS, UCS, Greedy Search, and A*. Features interactive visualizations and step-by-step algorithm comparisons using Saudi city examples.

BFS DFS A* Search Heuristics State Space
Lecture 1: Introduction to AI

Overview of artificial intelligence, its history, applications, and current state. Introduction to different AI paradigms and problem-solving approaches.

AI History Applications Problem Solving AI Paradigms
Lecture 2: Intelligent Agents

Understanding intelligent agents, agent architectures, environment types, and agent performance measures. Rational agents and agent design principles.

Agent Types Environments Rationality PEAS
Lecture 4: Local Search Algorithms

Hill climbing, simulated annealing, genetic algorithms, and optimization techniques. Interactive demonstrations with N-Queens, TSP, and visual search landscapes.

Hill Climbing Simulated Annealing Genetic Algorithms Optimization TSP
Lecture 5: Adversarial Search & Games

Complete minimax algorithm walkthrough with interactive tic-tac-toe demos. Features step-by-step explanations, alpha-beta pruning, depth-limited search, and multiple evaluation perspectives.

Minimax Alpha-Beta Game Trees Interactive Demos Evaluation Functions
Lecture 6: Constraint Satisfaction Problems

Interactive CSP formulation, backtracking search with visualization, constraint propagation demos, and smart heuristics. Features Saudi map coloring, N-Queens, and Sudoku solver examples.

Backtracking Arc Consistency Interactive Demos Smart Heuristics Real Applications
Lecture 7: Logical Agents & Knowledge-Based Agents

Comprehensive coverage of knowledge-based agents, logical reasoning, propositional and first-order logic, inference techniques, and the classic Wumpus World case study. Features step-by-step reasoning demos.

Knowledge-Based Agents Propositional Logic First-Order Logic Inference Techniques Wumpus World
Lecture 8: Introduction to Machine Learning

Supervised, unsupervised, and reinforcement learning. Decision trees, neural networks, and basic ML algorithms with practical examples.

Decision Trees Neural Networks Clustering Classification
Lecture 9: Classical Planning & Planning Algorithms

Complete coverage of classical planning with STRIPS and PDDL representations. Interactive visualizations of forward search, backward search, and SAT-based planning with Saudi Air Cargo and Spare Tire examples.

STRIPS PDDL Forward Search Backward Search SAT Planning
Lecture 10: Foundations of Uncertainty & Probability

Paradigm shift from formal logic to probabilistic reasoning. Explores why AI needs uncertainty modeling, covering probability theory fundamentals, Bayes' rule, and the philosophical contrast between absolute and partial knowledge.

Probability Theory Bayesian Reasoning Conditional Probability Independence Uncertainty Modeling
Lecture 11: Bayesian Networks & Probabilistic Inference

Comprehensive coverage of Bayesian Networks as compact representations of joint distributions. Features conditional independence, d-separation, exact inference (variable elimination, belief propagation), and approximate methods (MCMC, Gibbs sampling) with real-world applications.

Bayesian Networks d-Separation Variable Elimination Belief Propagation MCMC Sampling
Lecture 12: Decision Theory & Utility

Rational decision-making under uncertainty using utility theory. Covers preference modeling, expected utility maximization, value of information, and decision networks with real-world applications in medical diagnosis and resource allocation.

Utility Theory Expected Utility Value of Information Decision Networks Preference Modeling
Lecture 13: Game Theory & Nash Equilibrium

Multi-player strategic games and Nash equilibrium. Covers dominant strategies, best response analysis, mixed strategies, and applications in AI, economics, and multi-agent systems.

Nash Equilibrium Dominant Strategies Mixed Strategies Multi-Agent AI Game Theory

Course Project: RoboMind

Build a Rational AI Agent!

Apply everything you've learned in an integrated semester project. Build an intelligent agent that navigates a grid world using search algorithms, logical reasoning, and probabilistic inference.

Technologies: Python, Pygame, NumPy, Matplotlib
Duration: 3 weeks (intensive implementation)
Difficulty: Progressive (starts easy, builds up)
⚠️ Tight deadline - Start immediately!

Search (BFS, UCS, A*) Logic Inference Bayesian Reasoning Hybrid Integration
View on GitHub Project Requirements

Individual project
Starter code on GitHub
AI policy included