YoVDO

Depth First Iterative Deepening

Offered By: NPTEL-NOC IITM via YouTube

Tags

Depth-First Search Courses Computer Science Courses Artificial Intelligence Courses Graph Algorithms Courses Search Algorithms Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore the concept of Depth First Iterative Deepening in this 14-minute video lecture from NPTEL-NOC IITM. Learn about this important algorithm in computer science and artificial intelligence, which combines the space efficiency of depth-first search with the completeness of breadth-first search. Understand how this technique works by repeatedly running a depth-limited search with increasing depth limits until the goal is found. Discover the advantages of this approach, including its ability to find optimal solutions in scenarios where the depth of the solution is unknown. Gain insights into its applications in game trees, puzzle solving, and path-finding problems.

Syllabus

Depth First Iterative Deepening


Taught by

NPTEL-NOC IITM

Related Courses

Intro to Algorithms
Udacity Algorithmic Thinking (Part 1)
Rice University via Coursera Design and Analysis of Algorithms
Chennai Mathematical Institute via Swayam Capstone: Analyzing (Social) Network Data
University of California, San Diego via Coursera Algorithms on Graphs
University of California, San Diego via Coursera