Introduction to Artificial Intelligence - Problem Solving and Search - Lecture 3

Explore fundamental problem-solving techniques and search algorithms in this artificial intelligence lecture from Memorial University's Computer Science program. Learn how to formulate problems systematically and understand the core concepts of search through practical graph examples. Master essential search strategies including breadth-first search (BFS), uniform cost search (UCS), depth-first search (DFS), depth-limited search (DLS), and iterative deepening depth-first search (IDDFS). Discover how to construct and navigate search trees, implement tree search algorithms, and evaluate problem-solving performance metrics. Compare different algorithmic approaches and understand the importance of closed lists in graph search algorithms. Gain practical insights into when and why to use specific search strategies based on problem characteristics and performance requirements. Review key concepts through exam-style questions that reinforce your understanding of AI problem-solving fundamentals.