COMP6980 - Intro to Artificial Intelligence - Lecture 03 - Problem Solving and Search
00:00 - Problem Solving Agents
01:08 - Example Problem
02:37 - Goal Formulation
04:04 - Problem Definition
09:44 - Paths and Costs
12:18 - Example Graph Problem
16:17 - What is Search?
18:06 - The Search Tree
22:37 - Sliding Tile Puzzle
22:46 - Which Node to Expand?
25:52 - Search Node Data
27:27 - Node vs State
29:11 - The Fringe (Open List)
30:18 - General Uninformed Tree Search
33:31 - Expand Function
36:23 - Problem Solving Performance
40:43 - Recap / Exam Questions
41:25 - Search Strategies
42:17 - Breadth-First Search (BFS)
53:11 - Uniform Cost Search (UCS)
56:53 - Depth-First Search (DFS)
01:03:42 - Depth-Limited Search (DLS)
01:06:04 - Iterative Deepening Depth-First Search (ID-DFS)
01:14:07 - Recap of Performance
01:15:45 - Avoiding Repeated States (Closed List)
01:18:39 - General Graph Search (with Closed List)
01:20:56 - Assignment 1 Algorithm Pseudocode
01:22:51 - "Tree Search" vs "Graph Search"
Memorial University - Computer Science 6980 - Winter 2024
Intro to Artificial Intelligence
Professor: David Churchill - http://www.cs.mun.ca/~dchurchill/
This course is an introduction to Artificial Intelligence (AI), covering algorithmic techniques and data structures used in modern problem-solving environments. Each topic will have a related assignment where the learned techniques are applied to simple games. This is the graduate version of COMP 3200.
Course Assignments / Files will not be released publicly