Defining a Search Problem in AI
Offered By: Neuro Symbolic via YouTube
Course Description
Overview
Explore classic search algorithms in AI through this 21-minute video lecture. Delve into uninformed search methods like Depth-First Search (DFS) and Breadth-First Search (BFS), as well as informed techniques such as A* and heuristic development. Discover advanced strategies including cycle pruning, multipath pruning, and bidirectional search. Learn from slides based on the 3rd edition of "Artificial Intelligence: foundations of computational agents" by David L. Poole and Alan K. Mackworth. Part of the Neuro Symbolic Channel's series, this lecture combines symbolic methods and deep learning concepts, offering insights into cutting-edge AI research and progress towards artificial general intelligence (AGI).
Syllabus
Defining a Search Problem in AI
Taught by
Neuro Symbolic
Related Courses
算法基础Peking University via Coursera 算法基础 | Fundamental Algorithms
Peking University via edX 算法基础
Peking University via Coursera Graph Search, Shortest Paths, and Data Structures
Stanford University via Coursera Data Structures and Algorithms
Georgia Institute of Technology via edX