COMP338: Artificial Intelligence
Quizzes & Exams
Quiz #1: Problem formulation & uninformed search
Quiz #1 (Section 3), with every question reproduced as it appeared on the paper and full worked solutions plus marking criteria: the Map Colouring problem formulation, and DFS / Uniform-Cost Search on a weighted graph.
Open quiz & answersPart I: Problem Solving by Search
Lecture material by Prof. Mustafa Jarrar (Birzeit University). Open each lecture's slides below; the chapters marked companion are expanded into interactive, worked walkthroughs on this site. Full course: jarrar.info/courses/AI.
Study Companions
Problem Formulation and Search Algorithms
An interactive walkthrough of how AI problems are formulated as search: states, actions, goal tests, and path costs, followed by uninformed and informed search algorithms with worked examples. Covers chapters 2 to 4 of the course (problem-solving agents, uninformed search, informed search, local search) plus memory-bounded heuristic search.
Open companionGames and Adversarial Search
An interactive walkthrough of Chapter 5: game trees, minimax, and alpha–beta pruning, with a step-through tree visualiser (minimax and alpha–beta on the same tree, with live α/β windows and pruning), a move-ordering efficiency demo, an evaluation-function calculator, and a tic-tac-toe board you can play against an unbeatable minimax opponent. Includes Jarrar's exercise tree.
Open companion