ConceptAI & ML
Depth-first search
A search strategy that explores as far as possible along each branch before backtracking.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
5Each in their own terms, from the easiest level.
Patrick Winston
A search method where you barrel ahead in a single-minded way down one branch until you get stuck.Brian Yu
The search algorithm where we always explore the deepest node in the frontier.Erik Demaine
A graph traversal algorithm that explores as far as possible along each branch before backtracking.Victor Costan
An algorithm that starts at a node and recursively visits the unvisited neighbors along each branch before backtracking.
Lectures that assume it
7- Search with Other Agents: Minimax
- Constraints: Search and Domain Reduction
- Games, Minimax, and Alpha-Beta Pruning (MIT 6.034 Artificial Intelligence)
- Constraint Satisfaction Problems (CSPs) Part 1/2
- Hopcroft–Paul–Valiant Theorem
- Speculative Parallelism & Leiserchess
- Constraint Satisfaction Problems (CSPs) Part 2/2
Connections
23The lectures that define it or assume it, and the concepts next to it.
Concepts10
Show 4 moreShow fewer
Lectures13
- Uninformed Search
- Harvard CS50’s Artificial Intelligence with Python – Full University Course
- Constraints: Interpreting Line Drawings
- Depth-First Search (DFS), Topological Sort
- Search: Depth-First, Hill Climbing, Beam Search
- Depth-First Search (DFS) (MIT 6.006, Recitation 14)
Show 7 moreShow fewer
- Search with Other Agents: Minimax
- Constraints: Search and Domain Reduction
- Games, Minimax, and Alpha-Beta Pruning (MIT 6.034 Artificial Intelligence)
- Constraint Satisfaction Problems (CSPs) Part 1/2
- Hopcroft–Paul–Valiant Theorem
- Speculative Parallelism & Leiserchess
- Constraint Satisfaction Problems (CSPs) Part 2/2